./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:53:50,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:53:50,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:53:50,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:53:50,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:53:50,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:53:50,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:53:50,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:53:50,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:53:50,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:53:50,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:53:50,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:53:50,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:53:50,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:53:50,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:53:50,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:53:50,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:53:50,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:53:50,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:53:50,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:53:50,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:53:50,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:53:50,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:53:50,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:53:50,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:53:50,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:53:50,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:53:50,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:53:50,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:53:50,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:53:50,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:53:50,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:53:50,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:53:50,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:53:50,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:53:50,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:53:50,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:53:50,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:53:50,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:53:50,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:53:50,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:53:51,000 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-20 23:53:51,032 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:53:51,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:53:51,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:53:51,034 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:53:51,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:53:51,035 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:53:51,035 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:53:51,036 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:53:51,036 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:53:51,036 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-20 23:53:51,037 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:53:51,037 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:53:51,038 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-20 23:53:51,038 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-20 23:53:51,038 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:53:51,039 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-20 23:53:51,039 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-20 23:53:51,040 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-20 23:53:51,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 23:53:51,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 23:53:51,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:53:51,042 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:53:51,042 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 23:53:51,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 23:53:51,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:53:51,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:53:51,044 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 23:53:51,044 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 23:53:51,044 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 23:53:51,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:53:51,045 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 23:53:51,045 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:53:51,045 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:53:51,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:53:51,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:53:51,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:53:51,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:53:51,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:53:51,047 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-20 23:53:51,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 23:53:51,047 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:53:51,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:53:51,048 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/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_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2021-11-20 23:53:51,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:53:51,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:53:51,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:53:51,329 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:53:51,330 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:53:51,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2021-11-20 23:53:51,402 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/data/82fe3173c/bdc827e4b7e44c608d05ef68414509bb/FLAG9c61dc30d [2021-11-20 23:53:51,867 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:53:51,869 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2021-11-20 23:53:51,890 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/data/82fe3173c/bdc827e4b7e44c608d05ef68414509bb/FLAG9c61dc30d [2021-11-20 23:53:52,190 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/data/82fe3173c/bdc827e4b7e44c608d05ef68414509bb [2021-11-20 23:53:52,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:53:52,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:53:52,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:53:52,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:53:52,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:53:52,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300cdad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52, skipping insertion in model container [2021-11-20 23:53:52,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:53:52,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:53:52,557 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_9e372947-97d8-4655-8346-b04d5b08a631/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2021-11-20 23:53:52,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:53:52,574 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:53:52,631 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_9e372947-97d8-4655-8346-b04d5b08a631/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2021-11-20 23:53:52,634 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:53:52,672 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:53:52,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52 WrapperNode [2021-11-20 23:53:52,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:53:52,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:53:52,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:53:52,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:53:52,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,740 INFO L137 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2021-11-20 23:53:52,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:53:52,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:53:52,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:53:52,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:53:52,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:53:52,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:53:52,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:53:52,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:53:52,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52" (1/1) ... [2021-11-20 23:53:52,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:53:52,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:53:52,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:53:52,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:53:52,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 23:53:52,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 23:53:52,851 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-20 23:53:52,851 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-20 23:53:52,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 23:53:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:53:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 23:53:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 23:53:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 23:53:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 23:53:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 23:53:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 23:53:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:53:52,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:53:52,953 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:53:52,955 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:53:53,366 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:53:53,414 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:53:53,414 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-20 23:53:53,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:53:53 BoogieIcfgContainer [2021-11-20 23:53:53,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:53:53,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:53:53,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:53:53,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:53:53,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:53:52" (1/3) ... [2021-11-20 23:53:53,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c752999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:53:53, skipping insertion in model container [2021-11-20 23:53:53,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:52" (2/3) ... [2021-11-20 23:53:53,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c752999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:53:53, skipping insertion in model container [2021-11-20 23:53:53,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:53:53" (3/3) ... [2021-11-20 23:53:53,425 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2021-11-20 23:53:53,430 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:53:53,430 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2021-11-20 23:53:53,491 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:53:53,498 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 23:53:53,498 INFO L340 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2021-11-20 23:53:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 50 states have (on average 2.36) internal successors, (118), 106 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:53:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-20 23:53:53,565 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:53:53,566 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-20 23:53:53,566 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:53:53,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:53:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash 230586501, now seen corresponding path program 1 times [2021-11-20 23:53:53,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:53:53,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522158707] [2021-11-20 23:53:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:53:53,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:53:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:53:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:53:53,797 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:53:53,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522158707] [2021-11-20 23:53:53,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522158707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:53:53,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:53:53,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 23:53:53,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174198737] [2021-11-20 23:53:53,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:53:53,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:53:53,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:53:53,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:53:53,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:53:53,843 INFO L87 Difference]: Start difference. First operand has 111 states, 50 states have (on average 2.36) internal successors, (118), 106 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:53:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:53:54,009 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2021-11-20 23:53:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:53:54,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-20 23:53:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:53:54,020 INFO L225 Difference]: With dead ends: 109 [2021-11-20 23:53:54,020 INFO L226 Difference]: Without dead ends: 107 [2021-11-20 23:53:54,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:53:54,025 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:53:54,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 152 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:53:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-11-20 23:53:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-11-20 23:53:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 102 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:53:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2021-11-20 23:53:54,068 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 5 [2021-11-20 23:53:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:53:54,069 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2021-11-20 23:53:54,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:53:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2021-11-20 23:53:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-20 23:53:54,070 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:53:54,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-20 23:53:54,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 23:53:54,071 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:53:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:53:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash 230586502, now seen corresponding path program 1 times [2021-11-20 23:53:54,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:53:54,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181065809] [2021-11-20 23:53:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:53:54,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:53:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:53:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:53:54,145 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:53:54,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181065809] [2021-11-20 23:53:54,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181065809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:53:54,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:53:54,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 23:53:54,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64890553] [2021-11-20 23:53:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:53:54,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:53:54,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:53:54,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:53:54,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:53:54,149 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:53:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:53:54,289 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-11-20 23:53:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:53:54,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-20 23:53:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:53:54,291 INFO L225 Difference]: With dead ends: 105 [2021-11-20 23:53:54,293 INFO L226 Difference]: Without dead ends: 105 [2021-11-20 23:53:54,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:53:54,295 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:53:54,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 157 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:53:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-20 23:53:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-11-20 23:53:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 49 states have (on average 2.204081632653061) internal successors, (108), 100 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:53:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2021-11-20 23:53:54,307 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 5 [2021-11-20 23:53:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:53:54,308 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2021-11-20 23:53:54,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:53:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2021-11-20 23:53:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-20 23:53:54,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:53:54,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:53:54,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 23:53:54,310 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:53:54,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:53:54,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1950908672, now seen corresponding path program 1 times [2021-11-20 23:53:54,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:53:54,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539044016] [2021-11-20 23:53:54,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:53:54,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:53:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:53:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:53:54,395 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:53:54,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539044016] [2021-11-20 23:53:54,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539044016] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:53:54,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:53:54,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 23:53:54,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274852883] [2021-11-20 23:53:54,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:53:54,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:53:54,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:53:54,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:53:54,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:53:54,398 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 23:53:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:53:54,474 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2021-11-20 23:53:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:53:54,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-20 23:53:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:53:54,476 INFO L225 Difference]: With dead ends: 111 [2021-11-20 23:53:54,477 INFO L226 Difference]: Without dead ends: 111 [2021-11-20 23:53:54,477 INFO L932 BasicCegarLoop]: 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 [2021-11-20 23:53:54,479 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 4 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:53:54,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:53:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-20 23:53:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2021-11-20 23:53:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 50 states have (on average 2.18) internal successors, (109), 101 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:53:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2021-11-20 23:53:54,501 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 10 [2021-11-20 23:53:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:53:54,502 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2021-11-20 23:53:54,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 23:53:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2021-11-20 23:53:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-20 23:53:54,504 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:53:54,504 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:53:54,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 23:53:54,505 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:53:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:53:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1604454864, now seen corresponding path program 1 times [2021-11-20 23:53:54,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:53:54,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597505145] [2021-11-20 23:53:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:53:54,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:53:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:53:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:53:54,651 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:53:54,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597505145] [2021-11-20 23:53:54,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597505145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:53:54,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:53:54,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 23:53:54,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036592014] [2021-11-20 23:53:54,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:53:54,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:53:54,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:53:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:53:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:53:54,657 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:53:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:53:54,929 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2021-11-20 23:53:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:53:54,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-20 23:53:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:53:54,936 INFO L225 Difference]: With dead ends: 106 [2021-11-20 23:53:54,936 INFO L226 Difference]: Without dead ends: 106 [2021-11-20 23:53:54,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 23:53:54,947 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 9 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:53:54,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 302 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:53:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-11-20 23:53:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2021-11-20 23:53:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 50 states have (on average 2.16) internal successors, (108), 100 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:53:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2021-11-20 23:53:54,965 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 17 [2021-11-20 23:53:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:53:54,965 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2021-11-20 23:53:54,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:53:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2021-11-20 23:53:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-20 23:53:54,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:53:54,966 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:53:54,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 23:53:54,967 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:53:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:53:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1604454863, now seen corresponding path program 1 times [2021-11-20 23:53:54,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:53:54,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358725645] [2021-11-20 23:53:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:53:54,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:53:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:53:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:53:55,103 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:53:55,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358725645] [2021-11-20 23:53:55,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358725645] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:53:55,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:53:55,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 23:53:55,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332691950] [2021-11-20 23:53:55,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:53:55,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:53:55,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:53:55,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:53:55,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:53:55,106 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:53:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:53:55,286 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2021-11-20 23:53:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:53:55,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-20 23:53:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:53:55,288 INFO L225 Difference]: With dead ends: 105 [2021-11-20 23:53:55,289 INFO L226 Difference]: Without dead ends: 105 [2021-11-20 23:53:55,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 23:53:55,294 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:53:55,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 326 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:53:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-20 23:53:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-11-20 23:53:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 50 states have (on average 2.14) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:53:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2021-11-20 23:53:55,316 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 17 [2021-11-20 23:53:55,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:53:55,317 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2021-11-20 23:53:55,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:53:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2021-11-20 23:53:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-20 23:53:55,318 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:53:55,319 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:53:55,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 23:53:55,319 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:53:55,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:53:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash 12336050, now seen corresponding path program 1 times [2021-11-20 23:53:55,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:53:55,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579939232] [2021-11-20 23:53:55,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:53:55,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:53:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:53:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:53:55,465 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:53:55,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579939232] [2021-11-20 23:53:55,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579939232] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:53:55,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445216950] [2021-11-20 23:53:55,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:53:55,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:53:55,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:53:55,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:53:55,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 23:53:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:53:55,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-20 23:53:55,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:53:55,619 INFO L388 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 [2021-11-20 23:53:55,791 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-20 23:53:55,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 [2021-11-20 23:53:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:53:55,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 23:53:55,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445216950] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:53:55,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 23:53:55,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2021-11-20 23:53:55,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236446191] [2021-11-20 23:53:55,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:53:55,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 23:53:55,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:53:55,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 23:53:55,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-20 23:53:55,870 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:53:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:53:56,191 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2021-11-20 23:53:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 23:53:56,191 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-11-20 23:53:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:53:56,193 INFO L225 Difference]: With dead ends: 122 [2021-11-20 23:53:56,193 INFO L226 Difference]: Without dead ends: 122 [2021-11-20 23:53:56,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:53:56,194 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 186 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:53:56,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 357 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 23:53:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-11-20 23:53:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2021-11-20 23:53:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 50 states have (on average 2.12) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:53:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2021-11-20 23:53:56,203 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 19 [2021-11-20 23:53:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:53:56,204 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2021-11-20 23:53:56,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:53:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2021-11-20 23:53:56,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-20 23:53:56,205 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:53:56,205 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:53:56,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 23:53:56,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:53:56,433 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:53:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:53:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash 12336051, now seen corresponding path program 1 times [2021-11-20 23:53:56,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:53:56,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635182590] [2021-11-20 23:53:56,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:53:56,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:53:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:53:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:53:56,582 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:53:56,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635182590] [2021-11-20 23:53:56,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635182590] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:53:56,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366318424] [2021-11-20 23:53:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:53:56,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:53:56,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:53:56,584 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:53:56,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 23:53:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:53:56,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-20 23:53:56,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:53:56,688 INFO L388 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 [2021-11-20 23:53:56,879 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-20 23:53:56,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 [2021-11-20 23:53:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:53:56,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:53:57,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366318424] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:53:57,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1945861686] [2021-11-20 23:53:57,092 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-20 23:53:57,092 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:53:57,096 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:53:57,102 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:53:57,102 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:53:57,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:53:57,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:53:57,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-20 23:53:57,324 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-20 23:53:57,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-20 23:53:57,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 9 [2021-11-20 23:53:57,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 23:53:57,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-20 23:53:57,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 23:53:57,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 23:53:57,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-20 23:53:57,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:53:57,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-20 23:53:57,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:53:57,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-20 23:53:57,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:53:57,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:53:57,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-20 23:53:57,723 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-20 23:53:57,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-20 23:53:57,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:53:57,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:53:57,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-20 23:53:58,327 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:53:58,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-20 23:53:58,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:58,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:53:58,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:58,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:58,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:53:58,640 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:53:58,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-20 23:53:58,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:58,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:53:58,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:58,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:53:58,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:59,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-20 23:53:59,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-20 23:53:59,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:53:59,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-20 23:53:59,410 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:53:59,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-20 23:53:59,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:59,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:59,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:59,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:53:59,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:53:59,706 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:53:59,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-20 23:53:59,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:59,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:59,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:53:59,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:53:59,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:54:00,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:54:00,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-20 23:54:00,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-20 23:54:00,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-20 23:54:00,482 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:54:00,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-20 23:54:00,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:54:00,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:54:00,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:54:00,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:54:00,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:54:00,750 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:54:00,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-20 23:54:00,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:54:00,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-20 23:54:00,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:54:00,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:54:00,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-20 23:54:01,175 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:54:01,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-20 23:54:01,532 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-20 23:54:01,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-20 23:54:01,585 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 88 for LOIs [2021-11-20 23:54:03,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 23:54:03,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:54:03,507 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Some non-self update cases but no top-level DER relation at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:340) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:278) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 23:54:03,511 INFO L158 Benchmark]: Toolchain (without parser) took 11318.14ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 74.0MB in the beginning and 59.2MB in the end (delta: 14.9MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2021-11-20 23:54:03,511 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 113.2MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 23:54:03,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.72ms. Allocated memory is still 113.2MB. Free memory was 73.8MB in the beginning and 81.0MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 23:54:03,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.36ms. Allocated memory is still 113.2MB. Free memory was 81.0MB in the beginning and 78.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 23:54:03,512 INFO L158 Benchmark]: Boogie Preprocessor took 30.74ms. Allocated memory is still 113.2MB. Free memory was 78.6MB in the beginning and 76.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 23:54:03,513 INFO L158 Benchmark]: RCFGBuilder took 644.24ms. Allocated memory is still 113.2MB. Free memory was 76.8MB in the beginning and 53.4MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-20 23:54:03,513 INFO L158 Benchmark]: TraceAbstraction took 10092.09ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 53.1MB in the beginning and 59.2MB in the end (delta: -6.1MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2021-11-20 23:54:03,515 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 113.2MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.72ms. Allocated memory is still 113.2MB. Free memory was 73.8MB in the beginning and 81.0MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.36ms. Allocated memory is still 113.2MB. Free memory was 81.0MB in the beginning and 78.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.74ms. Allocated memory is still 113.2MB. Free memory was 78.6MB in the beginning and 76.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 644.24ms. Allocated memory is still 113.2MB. Free memory was 76.8MB in the beginning and 53.4MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10092.09ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 53.1MB in the beginning and 59.2MB in the end (delta: -6.1MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Some non-self update cases but no top-level DER relation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Some non-self update cases but no top-level DER relation: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-20 23:54:03,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:54:05,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:54:05,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:54:05,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:54:05,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:54:05,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:54:05,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:54:05,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:54:05,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:54:05,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:54:06,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:54:06,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:54:06,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:54:06,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:54:06,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:54:06,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:54:06,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:54:06,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:54:06,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:54:06,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:54:06,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:54:06,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:54:06,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:54:06,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:54:06,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:54:06,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:54:06,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:54:06,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:54:06,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:54:06,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:54:06,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:54:06,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:54:06,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:54:06,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:54:06,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:54:06,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:54:06,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:54:06,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:54:06,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:54:06,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:54:06,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:54:06,054 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-20 23:54:06,084 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:54:06,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:54:06,088 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:54:06,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:54:06,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:54:06,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:54:06,090 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:54:06,090 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:54:06,090 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:54:06,090 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:54:06,091 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:54:06,092 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:54:06,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 23:54:06,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 23:54:06,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:54:06,093 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:54:06,094 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 23:54:06,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 23:54:06,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:54:06,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:54:06,095 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 23:54:06,095 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 23:54:06,095 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 23:54:06,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:54:06,095 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 23:54:06,096 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 23:54:06,096 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 23:54:06,096 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:54:06,096 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:54:06,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:54:06,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 23:54:06,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:54:06,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:54:06,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:54:06,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:54:06,098 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-20 23:54:06,099 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 23:54:06,099 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:54:06,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:54:06,099 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/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_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2021-11-20 23:54:06,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:54:06,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:54:06,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:54:06,486 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:54:06,486 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:54:06,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2021-11-20 23:54:06,554 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/data/b4bc615c6/92b4fab2926a4e18ad036c71a9c4aa41/FLAG060cd4263 [2021-11-20 23:54:07,176 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:54:07,177 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2021-11-20 23:54:07,197 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/data/b4bc615c6/92b4fab2926a4e18ad036c71a9c4aa41/FLAG060cd4263 [2021-11-20 23:54:07,453 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/data/b4bc615c6/92b4fab2926a4e18ad036c71a9c4aa41 [2021-11-20 23:54:07,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:54:07,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:54:07,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:54:07,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:54:07,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:54:07,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:54:07" (1/1) ... [2021-11-20 23:54:07,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f78e96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:07, skipping insertion in model container [2021-11-20 23:54:07,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:54:07" (1/1) ... [2021-11-20 23:54:07,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:54:07,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:54:07,864 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_9e372947-97d8-4655-8346-b04d5b08a631/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2021-11-20 23:54:07,872 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:54:07,888 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:54:07,969 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_9e372947-97d8-4655-8346-b04d5b08a631/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2021-11-20 23:54:07,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:54:08,017 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:54:08,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08 WrapperNode [2021-11-20 23:54:08,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:54:08,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:54:08,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:54:08,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:54:08,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08" (1/1) ... [2021-11-20 23:54:08,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08" (1/1) ... [2021-11-20 23:54:08,110 INFO L137 Inliner]: procedures = 130, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 153 [2021-11-20 23:54:08,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:54:08,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:54:08,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:54:08,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:54:08,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08" (1/1) ... [2021-11-20 23:54:08,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08" (1/1) ... [2021-11-20 23:54:08,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08" (1/1) ... [2021-11-20 23:54:08,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08" (1/1) ... [2021-11-20 23:54:08,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08" (1/1) ... [2021-11-20 23:54:08,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08" (1/1) ... [2021-11-20 23:54:08,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08" (1/1) ... [2021-11-20 23:54:08,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:54:08,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:54:08,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:54:08,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:54:08,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08" (1/1) ... [2021-11-20 23:54:08,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:54:08,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:54:08,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:54:08,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:54:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-20 23:54:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-20 23:54:08,257 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-20 23:54:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 23:54:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:54:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 23:54:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 23:54:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 23:54:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 23:54:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-20 23:54:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 23:54:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-20 23:54:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:54:08,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:54:08,399 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:54:08,401 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:54:09,059 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:54:09,066 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:54:09,066 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-20 23:54:09,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:54:09 BoogieIcfgContainer [2021-11-20 23:54:09,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:54:09,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:54:09,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:54:09,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:54:09,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:54:07" (1/3) ... [2021-11-20 23:54:09,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7233f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:54:09, skipping insertion in model container [2021-11-20 23:54:09,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:08" (2/3) ... [2021-11-20 23:54:09,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7233f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:54:09, skipping insertion in model container [2021-11-20 23:54:09,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:54:09" (3/3) ... [2021-11-20 23:54:09,076 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2021-11-20 23:54:09,081 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:54:09,082 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2021-11-20 23:54:09,125 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:54:09,132 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 23:54:09,132 INFO L340 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2021-11-20 23:54:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:54:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-20 23:54:09,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:54:09,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-20 23:54:09,156 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:54:09,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:54:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash 895521621, now seen corresponding path program 1 times [2021-11-20 23:54:09,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:54:09,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793238588] [2021-11-20 23:54:09,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:54:09,174 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:54:09,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:54:09,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:54:09,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 23:54:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:54:09,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 23:54:09,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:54:09,333 INFO L388 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 [2021-11-20 23:54:09,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:54:09,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:54:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:54:09,371 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:54:09,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793238588] [2021-11-20 23:54:09,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793238588] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:54:09,372 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:54:09,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-20 23:54:09,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329919994] [2021-11-20 23:54:09,375 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:54:09,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:54:09,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:54:09,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:54:09,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:54:09,412 INFO L87 Difference]: Start difference. First operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:54:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:54:09,643 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2021-11-20 23:54:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:54:09,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-20 23:54:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:54:09,654 INFO L225 Difference]: With dead ends: 125 [2021-11-20 23:54:09,655 INFO L226 Difference]: Without dead ends: 122 [2021-11-20 23:54:09,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:54:09,660 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:54:09,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 197 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:54:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-11-20 23:54:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-11-20 23:54:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.953125) internal successors, (125), 117 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:54:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2021-11-20 23:54:09,730 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 6 [2021-11-20 23:54:09,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:54:09,730 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2021-11-20 23:54:09,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:54:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2021-11-20 23:54:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-20 23:54:09,731 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:54:09,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-20 23:54:09,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-20 23:54:09,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:54:09,943 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:54:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:54:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash 895521622, now seen corresponding path program 1 times [2021-11-20 23:54:09,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:54:09,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891447083] [2021-11-20 23:54:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:54:09,945 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:54:09,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:54:09,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:54:09,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 23:54:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:54:10,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 23:54:10,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:54:10,071 INFO L388 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 [2021-11-20 23:54:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:54:10,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:54:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:54:10,197 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:54:10,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891447083] [2021-11-20 23:54:10,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891447083] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:54:10,202 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:54:10,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-20 23:54:10,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611957523] [2021-11-20 23:54:10,203 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:54:10,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 23:54:10,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:54:10,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 23:54:10,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:54:10,207 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:54:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:54:10,705 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2021-11-20 23:54:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:54:10,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-20 23:54:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:54:10,708 INFO L225 Difference]: With dead ends: 120 [2021-11-20 23:54:10,708 INFO L226 Difference]: Without dead ends: 120 [2021-11-20 23:54:10,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:54:10,710 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:54:10,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 273 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:54:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-20 23:54:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-11-20 23:54:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.921875) internal successors, (123), 115 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:54:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2021-11-20 23:54:10,722 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 6 [2021-11-20 23:54:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:54:10,722 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2021-11-20 23:54:10,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:54:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2021-11-20 23:54:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 23:54:10,723 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:54:10,723 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:54:10,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-20 23:54:10,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:54:10,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:54:10,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:54:10,938 INFO L85 PathProgramCache]: Analyzing trace with hash 164994135, now seen corresponding path program 1 times [2021-11-20 23:54:10,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:54:10,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611767431] [2021-11-20 23:54:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:54:10,939 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:54:10,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:54:10,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:54:10,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 23:54:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:54:11,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 23:54:11,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:54:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:54:11,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:54:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:54:11,116 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:54:11,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611767431] [2021-11-20 23:54:11,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611767431] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:54:11,116 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:54:11,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-20 23:54:11,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659545245] [2021-11-20 23:54:11,117 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:54:11,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 23:54:11,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:54:11,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 23:54:11,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:54:11,119 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:54:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:54:11,136 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2021-11-20 23:54:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 23:54:11,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2021-11-20 23:54:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:54:11,139 INFO L225 Difference]: With dead ends: 127 [2021-11-20 23:54:11,139 INFO L226 Difference]: Without dead ends: 127 [2021-11-20 23:54:11,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:54:11,141 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 14 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:54:11,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 250 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:54:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-20 23:54:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2021-11-20 23:54:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 116 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:54:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2021-11-20 23:54:11,154 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 13 [2021-11-20 23:54:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:54:11,154 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2021-11-20 23:54:11,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:54:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2021-11-20 23:54:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 23:54:11,156 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:54:11,156 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:54:11,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-20 23:54:11,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:54:11,370 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:54:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:54:11,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453220, now seen corresponding path program 1 times [2021-11-20 23:54:11,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:54:11,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957162170] [2021-11-20 23:54:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:54:11,372 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:54:11,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:54:11,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:54:11,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-20 23:54:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:54:11,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 23:54:11,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:54:11,510 INFO L388 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 [2021-11-20 23:54:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:54:11,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:54:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:54:11,687 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:54:11,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957162170] [2021-11-20 23:54:11,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957162170] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:54:11,696 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:54:11,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-20 23:54:11,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791732083] [2021-11-20 23:54:11,697 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:54:11,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:54:11,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:54:11,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:54:11,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:54:11,700 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:54:12,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:54:12,182 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2021-11-20 23:54:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:54:12,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-11-20 23:54:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:54:12,185 INFO L225 Difference]: With dead ends: 121 [2021-11-20 23:54:12,185 INFO L226 Difference]: Without dead ends: 121 [2021-11-20 23:54:12,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 23:54:12,187 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 12 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:54:12,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 378 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:54:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-20 23:54:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2021-11-20 23:54:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 115 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:54:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2021-11-20 23:54:12,198 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 22 [2021-11-20 23:54:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:54:12,198 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2021-11-20 23:54:12,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:54:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2021-11-20 23:54:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 23:54:12,200 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:54:12,200 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:54:12,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-20 23:54:12,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:54:12,407 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:54:12,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:54:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453219, now seen corresponding path program 1 times [2021-11-20 23:54:12,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:54:12,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663814542] [2021-11-20 23:54:12,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:54:12,408 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:54:12,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:54:12,409 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:54:12,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-20 23:54:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:54:12,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 23:54:12,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:54:12,537 INFO L388 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 [2021-11-20 23:54:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:54:12,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:54:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:54:13,074 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:54:13,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663814542] [2021-11-20 23:54:13,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663814542] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:54:13,074 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:54:13,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-20 23:54:13,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477692638] [2021-11-20 23:54:13,075 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:54:13,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:54:13,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:54:13,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:54:13,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-20 23:54:13,077 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 23:54:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:54:14,327 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2021-11-20 23:54:14,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:54:14,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2021-11-20 23:54:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:54:14,330 INFO L225 Difference]: With dead ends: 120 [2021-11-20 23:54:14,330 INFO L226 Difference]: Without dead ends: 120 [2021-11-20 23:54:14,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-20 23:54:14,331 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 13 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:54:14,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 612 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-20 23:54:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-20 23:54:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2021-11-20 23:54:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.876923076923077) internal successors, (122), 114 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:54:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2021-11-20 23:54:14,352 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 22 [2021-11-20 23:54:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:54:14,353 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2021-11-20 23:54:14,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 23:54:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2021-11-20 23:54:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:54:14,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:54:14,355 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:54:14,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-20 23:54:14,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:54:14,570 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:54:14,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:54:14,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296005, now seen corresponding path program 1 times [2021-11-20 23:54:14,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:54:14,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833010347] [2021-11-20 23:54:14,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:54:14,572 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:54:14,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:54:14,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:54:14,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-20 23:54:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:54:14,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 23:54:14,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:54:14,716 INFO L388 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 [2021-11-20 23:54:14,960 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-20 23:54:14,961 INFO L388 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 23 treesize of output 30 [2021-11-20 23:54:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:54:15,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:54:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:54:38,878 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:54:38,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833010347] [2021-11-20 23:54:38,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833010347] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:54:38,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1678531543] [2021-11-20 23:54:38,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:54:38,879 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-20 23:54:38,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-20 23:54:38,895 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-20 23:54:38,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-20 23:54:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:54:39,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 23:54:39,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:54:39,076 INFO L388 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 [2021-11-20 23:54:43,196 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-20 23:54:43,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 [2021-11-20 23:54:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:54:43,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:54:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:54:52,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1678531543] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:54:52,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:54:52,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 8, 6] total 18 [2021-11-20 23:54:52,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509233849] [2021-11-20 23:54:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:54:52,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:54:52,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:54:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:54:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=272, Unknown=11, NotChecked=0, Total=342 [2021-11-20 23:54:52,062 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:54:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:54:54,659 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2021-11-20 23:54:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:54:54,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-11-20 23:54:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:54:54,661 INFO L225 Difference]: With dead ends: 118 [2021-11-20 23:54:54,661 INFO L226 Difference]: Without dead ends: 118 [2021-11-20 23:54:54,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=69, Invalid=299, Unknown=12, NotChecked=0, Total=380 [2021-11-20 23:54:54,662 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:54:54,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 614 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 0 Unknown, 61 Unchecked, 0.6s Time] [2021-11-20 23:54:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-20 23:54:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-20 23:54:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:54:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2021-11-20 23:54:54,674 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 25 [2021-11-20 23:54:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:54:54,675 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2021-11-20 23:54:54,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:54:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2021-11-20 23:54:54,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:54:54,676 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:54:54,676 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:54:54,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-20 23:54:54,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-20 23:54:55,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt [2021-11-20 23:54:55,083 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:54:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:54:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296006, now seen corresponding path program 1 times [2021-11-20 23:54:55,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:54:55,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009447274] [2021-11-20 23:54:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:54:55,085 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:54:55,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:54:55,086 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:54:55,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-20 23:54:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:54:55,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 23:54:55,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:54:55,230 INFO L388 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 [2021-11-20 23:54:55,237 INFO L388 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 [2021-11-20 23:54:55,522 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:54:55,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 28 [2021-11-20 23:54:55,533 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:54:55,533 INFO L388 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 25 treesize of output 25 [2021-11-20 23:54:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:54:55,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:55:12,718 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) is different from false [2021-11-20 23:55:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:55:18,445 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:55:18,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009447274] [2021-11-20 23:55:18,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009447274] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:55:18,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1714224456] [2021-11-20 23:55:18,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:55:18,445 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-20 23:55:18,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-20 23:55:18,448 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-20 23:55:18,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-20 23:55:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:55:18,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 23:55:18,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:55:18,606 INFO L388 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 [2021-11-20 23:55:18,613 INFO L388 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 [2021-11-20 23:55:18,827 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:55:18,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 30 [2021-11-20 23:55:18,838 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:55:18,838 INFO L388 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 27 treesize of output 27 [2021-11-20 23:55:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:55:18,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:55:33,890 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) is different from false [2021-11-20 23:55:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:55:34,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1714224456] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:55:34,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001779818] [2021-11-20 23:55:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:55:34,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:55:34,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:55:34,362 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:55:34,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 23:55:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:55:34,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 23:55:34,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:55:34,448 INFO L388 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 [2021-11-20 23:55:34,455 INFO L388 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 [2021-11-20 23:55:34,699 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:55:34,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 34 [2021-11-20 23:55:34,736 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:55:34,736 INFO L388 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 31 treesize of output 31 [2021-11-20 23:55:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:55:34,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:55:56,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse1)) (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))))) is different from false [2021-11-20 23:55:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:55:57,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001779818] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:55:57,124 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-20 23:55:57,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 19 [2021-11-20 23:55:57,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900037415] [2021-11-20 23:55:57,124 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-20 23:55:57,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-20 23:55:57,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:55:57,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 23:55:57,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=217, Unknown=19, NotChecked=96, Total=380 [2021-11-20 23:55:57,126 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-20 23:55:59,293 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) (= |c_#length| |c_old(#length)|) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))))))))) is different from false [2021-11-20 23:56:01,314 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))))))))) is different from false [2021-11-20 23:56:03,343 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (= (_ bv8 32) (select |c_#length| |c_node_create_~temp~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse2) (bvule .cse2 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse3)) (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))))))))) is different from false [2021-11-20 23:56:05,359 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (= |c_node_create_#res#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse2) (bvule .cse2 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse3)) (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))))) (= (_ bv8 32) (select |c_#length| |c_node_create_#res#1.base|))) is different from false [2021-11-20 23:56:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:56:06,092 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2021-11-20 23:56:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:56:06,093 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2021-11-20 23:56:06,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:56:06,094 INFO L225 Difference]: With dead ends: 139 [2021-11-20 23:56:06,094 INFO L226 Difference]: Without dead ends: 139 [2021-11-20 23:56:06,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 60.1s TimeCoverageRelationStatistics Valid=72, Invalid=275, Unknown=23, NotChecked=280, Total=650 [2021-11-20 23:56:06,096 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 6 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 641 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:56:06,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 781 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 262 Invalid, 0 Unknown, 641 Unchecked, 0.8s Time] [2021-11-20 23:56:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-20 23:56:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2021-11-20 23:56:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 80 states have (on average 1.725) internal successors, (138), 128 states have internal predecessors, (138), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 23:56:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2021-11-20 23:56:06,105 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 25 [2021-11-20 23:56:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:56:06,105 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2021-11-20 23:56:06,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-20 23:56:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2021-11-20 23:56:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 23:56:06,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:56:06,107 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:56:06,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-20 23:56:06,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-11-20 23:56:06,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-20 23:56:06,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt [2021-11-20 23:56:06,719 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:56:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:56:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704927, now seen corresponding path program 1 times [2021-11-20 23:56:06,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:56:06,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048509731] [2021-11-20 23:56:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:56:06,720 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:56:06,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:56:06,721 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:56:06,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-20 23:56:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:56:06,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 23:56:06,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:56:06,919 INFO L388 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 [2021-11-20 23:56:06,944 INFO L388 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 13 treesize of output 11 [2021-11-20 23:56:07,115 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-20 23:56:07,115 INFO L388 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 24 treesize of output 31 [2021-11-20 23:56:07,272 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:56:07,272 INFO L388 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 37 treesize of output 33 [2021-11-20 23:56:07,468 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-20 23:56:07,469 INFO L388 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 3 case distinctions, treesize of input 54 treesize of output 65 [2021-11-20 23:56:08,280 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-20 23:56:08,281 INFO L388 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 3 case distinctions, treesize of input 56 treesize of output 67 [2021-11-20 23:56:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:56:08,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:56:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:56:51,061 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:56:51,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048509731] [2021-11-20 23:56:51,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048509731] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:56:51,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [248392660] [2021-11-20 23:56:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:56:51,062 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-20 23:56:51,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-20 23:56:51,066 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-20 23:56:51,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-11-20 23:56:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:56:51,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 23:56:51,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:56:51,483 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-20 23:56:51,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 [2021-11-20 23:56:51,642 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:56:51,642 INFO L388 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 29 treesize of output 25 [2021-11-20 23:56:51,918 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-20 23:56:51,918 INFO L388 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 3 case distinctions, treesize of input 39 treesize of output 50 [2021-11-20 23:56:52,439 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-20 23:56:52,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 58 [2021-11-20 23:56:56,842 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-20 23:56:56,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 84 [2021-11-20 23:56:57,984 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-20 23:56:57,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 55 [2021-11-20 23:56:58,283 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-20 23:56:58,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 90 [2021-11-20 23:56:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-20 23:56:58,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:57:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-20 23:57:05,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [248392660] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:57:05,329 INFO L186 FreeRefinementEngine]: Found 2 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:57:05,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [10, 10] total 26 [2021-11-20 23:57:05,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859398137] [2021-11-20 23:57:05,329 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:57:05,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:57:05,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:57:05,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:57:05,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=568, Unknown=21, NotChecked=0, Total=702 [2021-11-20 23:57:05,331 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 23:57:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:57:06,061 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2021-11-20 23:57:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:57:06,062 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2021-11-20 23:57:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:57:06,063 INFO L225 Difference]: With dead ends: 151 [2021-11-20 23:57:06,063 INFO L226 Difference]: Without dead ends: 151 [2021-11-20 23:57:06,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 50.1s TimeCoverageRelationStatistics Valid=113, Invalid=568, Unknown=21, NotChecked=0, Total=702 [2021-11-20 23:57:06,065 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:57:06,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 452 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 244 Unchecked, 0.7s Time] [2021-11-20 23:57:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-20 23:57:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 132. [2021-11-20 23:57:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 80 states have (on average 1.675) internal successors, (134), 124 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 23:57:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2021-11-20 23:57:06,073 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 37 [2021-11-20 23:57:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:57:06,074 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2021-11-20 23:57:06,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 23:57:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2021-11-20 23:57:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 23:57:06,075 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:57:06,075 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:57:06,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2021-11-20 23:57:06,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-11-20 23:57:06,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:57:06,478 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-20 23:57:06,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:57:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704928, now seen corresponding path program 1 times [2021-11-20 23:57:06,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:57:06,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925383737] [2021-11-20 23:57:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:57:06,480 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:57:06,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:57:06,492 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:57:06,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-20 23:57:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:57:06,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-20 23:57:06,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:57:06,690 INFO L388 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 [2021-11-20 23:57:06,701 INFO L388 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 [2021-11-20 23:57:06,752 INFO L388 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 19 treesize of output 17 [2021-11-20 23:57:06,760 INFO L388 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 9 treesize of output 7 [2021-11-20 23:57:07,039 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:57:07,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 28 [2021-11-20 23:57:07,049 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:57:07,049 INFO L388 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 25 treesize of output 21 [2021-11-20 23:57:07,196 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:57:07,196 INFO L388 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 14 treesize of output 14 [2021-11-20 23:57:07,505 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-20 23:57:07,506 INFO L388 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 3 case distinctions, treesize of input 29 treesize of output 34 [2021-11-20 23:57:08,560 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-20 23:57:08,560 INFO L388 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 3 case distinctions, treesize of input 23 treesize of output 32 [2021-11-20 23:57:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:57:08,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:59:10,689 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_106| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_111| (_ BitVec 32))) (or (not (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|)) (exists ((|v_node_create_~temp~0#1.base_106| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_110| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_110|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_110| (_ bv8 32)) |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))) (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_111| (_ bv8 32)) |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_111|))))) is different from true [2021-11-20 23:59:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 12 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-20 23:59:10,704 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:59:10,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925383737] [2021-11-20 23:59:10,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925383737] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:59:10,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [6616589] [2021-11-20 23:59:10,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:59:10,705 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-20 23:59:10,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-20 23:59:10,712 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-20 23:59:10,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-11-20 23:59:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:59:10,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-20 23:59:10,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:59:10,959 INFO L388 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 [2021-11-20 23:59:13,279 INFO L388 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 9 treesize of output 7 [2021-11-20 23:59:13,647 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:59:13,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 17 [2021-11-20 23:59:14,359 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:59:14,359 INFO L388 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 17 treesize of output 13 [2021-11-20 23:59:17,125 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-20 23:59:17,125 INFO L388 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 3 case distinctions, treesize of input 23 treesize of output 28 [2021-11-20 23:59:20,624 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:59:20,624 INFO L388 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 17 treesize of output 13 [2021-11-20 23:59:21,138 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-20 23:59:21,139 INFO L388 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 3 case distinctions, treesize of input 32 treesize of output 37 [2021-11-20 23:59:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-20 23:59:21,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:02:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 21 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:02:18,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [6616589] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 00:02:18,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:02:18,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 11, 10] total 34 [2021-11-21 00:02:18,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181387] [2021-11-21 00:02:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:02:18,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-21 00:02:18,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:02:18,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-21 00:02:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=884, Unknown=79, NotChecked=64, Total=1190 [2021-11-21 00:02:18,500 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 00:02:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:02:19,319 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2021-11-21 00:02:19,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 00:02:19,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-11-21 00:02:19,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:02:19,321 INFO L225 Difference]: With dead ends: 132 [2021-11-21 00:02:19,321 INFO L226 Difference]: Without dead ends: 132 [2021-11-21 00:02:19,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 237.5s TimeCoverageRelationStatistics Valid=163, Invalid=884, Unknown=79, NotChecked=64, Total=1190 [2021-11-21 00:02:19,322 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 6 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:02:19,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 464 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 212 Unchecked, 0.8s Time] [2021-11-21 00:02:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-21 00:02:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2021-11-21 00:02:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 80 states have (on average 1.6625) internal successors, (133), 123 states have internal predecessors, (133), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:02:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2021-11-21 00:02:19,330 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 37 [2021-11-21 00:02:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:02:19,330 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2021-11-21 00:02:19,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 00:02:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2021-11-21 00:02:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-21 00:02:19,332 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:02:19,332 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:02:19,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2021-11-21 00:02:19,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-21 00:02:19,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:02:19,738 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-21 00:02:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:02:19,738 INFO L85 PathProgramCache]: Analyzing trace with hash 646382112, now seen corresponding path program 1 times [2021-11-21 00:02:19,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:02:19,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199533038] [2021-11-21 00:02:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:02:19,739 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:02:19,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:02:19,740 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:02:19,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-21 00:02:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:02:19,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 00:02:19,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:02:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-21 00:02:19,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:02:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-21 00:02:20,070 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:02:20,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199533038] [2021-11-21 00:02:20,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199533038] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:02:20,070 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:02:20,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 00:02:20,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791400248] [2021-11-21 00:02:20,071 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:02:20,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:02:20,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:02:20,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:02:20,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:02:20,072 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 00:02:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:02:20,558 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2021-11-21 00:02:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:02:20,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-11-21 00:02:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:02:20,560 INFO L225 Difference]: With dead ends: 147 [2021-11-21 00:02:20,560 INFO L226 Difference]: Without dead ends: 147 [2021-11-21 00:02:20,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:02:20,562 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 88 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:02:20,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 105 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-21 00:02:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-21 00:02:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2021-11-21 00:02:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 80 states have (on average 1.6375) internal successors, (131), 121 states have internal predecessors, (131), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:02:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2021-11-21 00:02:20,567 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 39 [2021-11-21 00:02:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:02:20,568 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2021-11-21 00:02:20,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 00:02:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2021-11-21 00:02:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-21 00:02:20,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:02:20,570 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:02:20,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-21 00:02:20,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:02:20,775 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-21 00:02:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:02:20,775 INFO L85 PathProgramCache]: Analyzing trace with hash 646382113, now seen corresponding path program 1 times [2021-11-21 00:02:20,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:02:20,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429916245] [2021-11-21 00:02:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:02:20,791 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:02:20,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:02:20,792 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:02:20,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-21 00:02:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:02:20,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:02:20,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:02:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-21 00:02:21,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:02:21,454 INFO L388 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 8 treesize of output 6 [2021-11-21 00:02:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-21 00:02:21,825 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:02:21,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429916245] [2021-11-21 00:02:21,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429916245] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:02:21,826 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:02:21,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-21 00:02:21,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774691300] [2021-11-21 00:02:21,826 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:02:21,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 00:02:21,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:02:21,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 00:02:21,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-21 00:02:21,827 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-21 00:02:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:02:22,303 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2021-11-21 00:02:22,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:02:22,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2021-11-21 00:02:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:02:22,305 INFO L225 Difference]: With dead ends: 124 [2021-11-21 00:02:22,305 INFO L226 Difference]: Without dead ends: 124 [2021-11-21 00:02:22,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-21 00:02:22,306 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 268 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:02:22,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 125 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-21 00:02:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-21 00:02:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-11-21 00:02:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 80 states have (on average 1.575) internal successors, (126), 116 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:02:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2021-11-21 00:02:22,310 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 39 [2021-11-21 00:02:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:02:22,311 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2021-11-21 00:02:22,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-21 00:02:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2021-11-21 00:02:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-21 00:02:22,312 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:02:22,313 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:02:22,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-21 00:02:22,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:02:22,524 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-21 00:02:22,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:02:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990998, now seen corresponding path program 1 times [2021-11-21 00:02:22,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:02:22,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017230245] [2021-11-21 00:02:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:02:22,526 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:02:22,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:02:22,526 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:02:22,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-21 00:02:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:02:22,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:02:22,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:02:22,713 INFO L388 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 [2021-11-21 00:02:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-21 00:02:23,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:02:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-21 00:02:23,445 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:02:23,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017230245] [2021-11-21 00:02:23,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017230245] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:02:23,446 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:02:23,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-21 00:02:23,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11176545] [2021-11-21 00:02:23,446 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:02:23,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:02:23,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:02:23,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:02:23,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:02:23,447 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 00:02:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:02:25,052 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2021-11-21 00:02:25,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:02:25,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2021-11-21 00:02:25,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:02:25,054 INFO L225 Difference]: With dead ends: 140 [2021-11-21 00:02:25,054 INFO L226 Difference]: Without dead ends: 140 [2021-11-21 00:02:25,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:02:25,055 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 82 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:02:25,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 265 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-21 00:02:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-11-21 00:02:25,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2021-11-21 00:02:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 80 states have (on average 1.55) internal successors, (124), 114 states have internal predecessors, (124), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:02:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2021-11-21 00:02:25,061 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 40 [2021-11-21 00:02:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:02:25,062 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2021-11-21 00:02:25,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 00:02:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2021-11-21 00:02:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-21 00:02:25,063 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:02:25,064 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:02:25,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-21 00:02:25,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:02:25,274 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-21 00:02:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:02:25,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990997, now seen corresponding path program 1 times [2021-11-21 00:02:25,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:02:25,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504008047] [2021-11-21 00:02:25,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:02:25,275 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:02:25,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:02:25,275 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:02:25,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-21 00:02:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:02:25,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 00:02:25,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:02:25,437 INFO L388 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 [2021-11-21 00:02:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-21 00:02:25,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:02:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-21 00:02:27,125 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:02:27,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504008047] [2021-11-21 00:02:27,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504008047] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:02:27,125 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:02:27,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-21 00:02:27,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009869163] [2021-11-21 00:02:27,126 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:02:27,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 00:02:27,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:02:27,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 00:02:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-21 00:02:27,127 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-21 00:02:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:02:29,434 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2021-11-21 00:02:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:02:29,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2021-11-21 00:02:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:02:29,436 INFO L225 Difference]: With dead ends: 120 [2021-11-21 00:02:29,436 INFO L226 Difference]: Without dead ends: 120 [2021-11-21 00:02:29,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-21 00:02:29,437 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 86 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:02:29,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 345 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-21 00:02:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-21 00:02:29,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-11-21 00:02:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.525) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:02:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2021-11-21 00:02:29,443 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 40 [2021-11-21 00:02:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:02:29,443 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2021-11-21 00:02:29,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-21 00:02:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2021-11-21 00:02:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-21 00:02:29,445 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:02:29,445 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:02:29,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-21 00:02:29,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:02:29,657 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-21 00:02:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:02:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801691, now seen corresponding path program 1 times [2021-11-21 00:02:29,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:02:29,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543590370] [2021-11-21 00:02:29,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:02:29,658 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:02:29,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:02:29,659 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:02:29,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-21 00:02:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:02:29,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-21 00:02:29,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:02:30,071 INFO L388 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 [2021-11-21 00:02:31,104 INFO L388 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 17 treesize of output 13 [2021-11-21 00:02:34,517 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 00:02:34,518 INFO L388 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 2 case distinctions, treesize of input 61 treesize of output 49 [2021-11-21 00:02:34,652 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-21 00:02:34,652 INFO L388 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 46 treesize of output 57 [2021-11-21 00:02:35,657 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 00:02:35,658 INFO L388 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 52 treesize of output 36 [2021-11-21 00:02:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:02:36,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:02:43,682 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) is different from false [2021-11-21 00:02:46,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) is different from false [2021-11-21 00:02:48,615 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) is different from false [2021-11-21 00:03:17,697 INFO L388 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 146 treesize of output 138 [2021-11-21 00:03:26,192 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:03:26,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 109 [2021-11-21 00:03:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-21 00:03:32,027 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:03:32,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543590370] [2021-11-21 00:03:32,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543590370] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:03:32,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [180655768] [2021-11-21 00:03:32,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:03:32,027 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:03:32,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:03:32,028 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:03:32,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-11-21 00:03:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:03:32,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-21 00:03:32,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:03:32,764 INFO L388 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 [2021-11-21 00:03:37,262 INFO L388 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 18 treesize of output 14 [2021-11-21 00:03:38,069 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 00:03:38,069 INFO L388 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 2 case distinctions, treesize of input 61 treesize of output 49 [2021-11-21 00:03:38,204 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-21 00:03:38,206 INFO L388 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 46 treesize of output 57 [2021-11-21 00:03:41,540 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 00:03:41,540 INFO L388 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 53 treesize of output 37 [2021-11-21 00:03:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:03:41,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:03:49,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1))))) is different from false [2021-11-21 00:03:51,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1))))) is different from false [2021-11-21 00:03:54,068 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1))))) is different from false [2021-11-21 00:03:56,968 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_178| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_178|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_178| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))))) (_ bv1 1))) (not (bvult |v_node_create_~temp~0#1.base_178| |c_#StackHeapBarrier|)))) is different from true [2021-11-21 00:03:56,989 INFO L388 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 146 treesize of output 138 [2021-11-21 00:04:04,724 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:04:04,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 109 [2021-11-21 00:04:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-21 00:04:05,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [180655768] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:04:05,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065021221] [2021-11-21 00:04:05,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:04:05,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:04:05,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:04:05,648 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:04:05,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-21 00:04:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:04:05,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-21 00:04:05,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:04:06,110 INFO L388 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 [2021-11-21 00:04:15,964 INFO L388 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 11 treesize of output 7 [2021-11-21 00:04:18,429 INFO L388 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 53 treesize of output 41 [2021-11-21 00:04:25,404 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-21 00:04:25,404 INFO L388 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 53 treesize of output 49 [2021-11-21 00:04:25,552 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 00:04:25,552 INFO L388 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 49 treesize of output 56 [2021-11-21 00:04:30,386 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:04:30,386 INFO L388 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 56 treesize of output 56 [2021-11-21 00:04:36,822 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:04:36,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2021-11-21 00:04:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:04:41,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:04:45,387 INFO L388 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 121 treesize of output 117 [2021-11-21 00:05:21,669 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (exists ((|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (exists ((v_DerPreprocessor_5 (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse0)))) (_ bv1 1))) (and (= .cse0 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))))) is different from true [2021-11-21 00:05:29,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (and (= .cse0 (_ bv0 32)) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| .cse0))))) (_ bv1 1)))))) is different from false [2021-11-21 00:05:31,744 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (and (= .cse0 (_ bv0 32)) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| .cse0))))) (_ bv1 1)))))) is different from true [2021-11-21 00:05:32,049 INFO L388 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 262 treesize of output 254 [2021-11-21 00:05:39,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (and (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|)))) is different from false [2021-11-21 00:05:41,142 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (and (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|)))) is different from true [2021-11-21 00:05:53,195 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (and (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_189|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_189| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_189|))))) is different from false [2021-11-21 00:05:55,204 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (and (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_189|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_189| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_189|))))) is different from true [2021-11-21 00:05:55,227 INFO L388 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 139 treesize of output 131 [2021-11-21 00:06:27,450 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:06:27,451 INFO L388 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 43 treesize of output 39 [2021-11-21 00:06:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-21 00:06:47,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065021221] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:06:47,029 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 00:06:47,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17, 16, 18, 18] total 74 [2021-11-21 00:06:47,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581677534] [2021-11-21 00:06:47,030 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 00:06:47,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-11-21 00:06:47,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:06:47,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-11-21 00:06:47,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=3694, Unknown=77, NotChecked=1474, Total=5550 [2021-11-21 00:06:47,034 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 75 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 65 states have internal predecessors, (142), 10 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-21 00:06:49,377 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv0 1) .cse0) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg .cse0)))) is different from false [2021-11-21 00:06:51,436 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (store (select |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) .cse0) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset|) (_ bv0 32)) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg .cse0)))) is different from false [2021-11-21 00:06:53,466 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from false [2021-11-21 00:06:55,510 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from false [2021-11-21 00:07:03,574 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (and (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_189|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_189| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_189|))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_178| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_178|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_178| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))))) (_ bv1 1))) (not (bvult |v_node_create_~temp~0#1.base_178| |c_#StackHeapBarrier|)))) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) is different from false [2021-11-21 00:07:05,625 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (and (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|)))) (= (_ bv0 1) .cse0) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg .cse0)))) is different from false [2021-11-21 00:07:07,689 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (and (= .cse0 (_ bv0 32)) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| .cse0))))) (_ bv1 1)))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (store (select |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32))) |c_#memory_$Pointer$.base|) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1))))) (= (_ bv0 1) .cse1) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset|) (_ bv0 32)) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg .cse1)))) is different from false [2021-11-21 00:07:09,739 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (exists ((|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (exists ((v_DerPreprocessor_5 (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse1)))) (_ bv1 1))) (and (= .cse1 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))))))) is different from false [2021-11-21 00:07:11,789 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (exists ((|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (exists ((v_DerPreprocessor_5 (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))))) (_ bv1 1))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse1)))) (_ bv1 1))) (and (= .cse1 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))))))) is different from false [2021-11-21 00:07:28,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:07:28,086 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2021-11-21 00:07:28,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-21 00:07:28,087 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 65 states have internal predecessors, (142), 10 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) Word has length 41 [2021-11-21 00:07:28,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:07:28,089 INFO L225 Difference]: With dead ends: 183 [2021-11-21 00:07:28,089 INFO L226 Difference]: Without dead ends: 183 [2021-11-21 00:07:28,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 159 SyntacticMatches, 9 SemanticMatches, 88 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 244.6s TimeCoverageRelationStatistics Valid=428, Invalid=4389, Unknown=93, NotChecked=3100, Total=8010 [2021-11-21 00:07:28,094 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 83 mSDsluCounter, 2728 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 3460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2801 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:07:28,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 2855 Invalid, 3460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 650 Invalid, 0 Unknown, 2801 Unchecked, 5.5s Time] [2021-11-21 00:07:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-21 00:07:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 128. [2021-11-21 00:07:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 119 states have internal predecessors, (130), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:07:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2021-11-21 00:07:28,102 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 41 [2021-11-21 00:07:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:07:28,102 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2021-11-21 00:07:28,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 65 states have internal predecessors, (142), 10 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-21 00:07:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2021-11-21 00:07:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-21 00:07:28,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:07:28,104 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:07:28,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2021-11-21 00:07:28,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-21 00:07:28,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-21 00:07:28,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:07:28,707 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 52 more)] === [2021-11-21 00:07:28,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:07:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801690, now seen corresponding path program 1 times [2021-11-21 00:07:28,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:07:28,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226129493] [2021-11-21 00:07:28,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:07:28,708 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:07:28,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:07:28,709 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:07:28,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e372947-97d8-4655-8346-b04d5b08a631/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-21 00:07:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:07:28,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-21 00:07:28,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:07:29,180 INFO L388 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 [2021-11-21 00:07:29,225 INFO L388 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 [2021-11-21 00:07:31,175 INFO L388 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 35 treesize of output 27 [2021-11-21 00:07:31,198 INFO L388 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 11 treesize of output 7 [2021-11-21 00:07:35,368 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 00:07:35,368 INFO L388 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 2 case distinctions, treesize of input 99 treesize of output 83 [2021-11-21 00:07:35,593 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 00:07:35,593 INFO L388 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 2 case distinctions, treesize of input 84 treesize of output 72 [2021-11-21 00:07:35,687 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-21 00:07:35,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 69 treesize of output 71 [2021-11-21 00:07:35,775 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-21 00:07:35,775 INFO L388 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 68 treesize of output 68 [2021-11-21 00:07:37,555 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 00:07:37,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2021-11-21 00:07:37,581 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 00:07:37,581 INFO L388 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 46 treesize of output 30 [2021-11-21 00:07:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:07:38,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:07:51,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_199| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_199|)))) (or (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_189| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_189|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199|) |v_node_create_~temp~0#1.offset_189| (_ bv0 32)) .cse0 v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|) (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_199| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_199|) |v_node_create_~temp~0#1.offset_189| (_ bv0 32)) .cse0 v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_189| (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199|) |v_node_create_~temp~0#1.offset_189| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_189|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) (bvult |v_node_create_~temp~0#1.base_199| |c_#StackHeapBarrier|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))) (let ((.cse2 (bvadd (_ bv4 32) .cse3))) (and (bvule .cse2 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse3 .cse2)))))) is different from false