./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_search-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04611f7cb9bdc3bfbd4f2358731c54027c595e1d ..................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_search-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04611f7cb9bdc3bfbd4f2358731c54027c595e1d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:25:16,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:25:16,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:25:16,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:25:16,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:25:16,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:25:16,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:25:17,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:25:17,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:25:17,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:25:17,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:25:17,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:25:17,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:25:17,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:25:17,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:25:17,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:25:17,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:25:17,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:25:17,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:25:17,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:25:17,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:25:17,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:25:17,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:25:17,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:25:17,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:25:17,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:25:17,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:25:17,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:25:17,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:25:17,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:25:17,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:25:17,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:25:17,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:25:17,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:25:17,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:25:17,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:25:17,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:25:17,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:25:17,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:25:17,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:25:17,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:25:17,084 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:25:17,133 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:25:17,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:25:17,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:25:17,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:25:17,136 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:25:17,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:25:17,136 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:25:17,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:25:17,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:25:17,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:25:17,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:25:17,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:25:17,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:25:17,139 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:25:17,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:25:17,139 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:25:17,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:25:17,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:25:17,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:25:17,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:25:17,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:25:17,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:25:17,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:25:17,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:25:17,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:25:17,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:25:17,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:25:17,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:25:17,142 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:25:17,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/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-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04611f7cb9bdc3bfbd4f2358731c54027c595e1d [2020-11-30 01:25:17,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:25:17,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:25:17,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:25:17,483 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:25:17,484 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:25:17,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/../../sv-benchmarks/c/list-properties/list_search-1.i [2020-11-30 01:25:17,568 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/data/9c66125ab/1e6703e6e4564ca9aa111ccb5ac13049/FLAGf73061b7b [2020-11-30 01:25:18,117 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:25:18,118 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/sv-benchmarks/c/list-properties/list_search-1.i [2020-11-30 01:25:18,142 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/data/9c66125ab/1e6703e6e4564ca9aa111ccb5ac13049/FLAGf73061b7b [2020-11-30 01:25:18,423 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/data/9c66125ab/1e6703e6e4564ca9aa111ccb5ac13049 [2020-11-30 01:25:18,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:25:18,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:25:18,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:25:18,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:25:18,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:25:18,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:25:18" (1/1) ... [2020-11-30 01:25:18,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dcdde14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18, skipping insertion in model container [2020-11-30 01:25:18,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:25:18" (1/1) ... [2020-11-30 01:25:18,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:25:18,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:25:18,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:25:18,860 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:25:18,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:25:18,952 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:25:18,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18 WrapperNode [2020-11-30 01:25:18,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:25:18,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:25:18,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:25:18,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:25:18,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18" (1/1) ... [2020-11-30 01:25:18,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18" (1/1) ... [2020-11-30 01:25:19,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:25:19,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:25:19,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:25:19,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:25:19,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18" (1/1) ... [2020-11-30 01:25:19,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18" (1/1) ... [2020-11-30 01:25:19,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18" (1/1) ... [2020-11-30 01:25:19,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18" (1/1) ... [2020-11-30 01:25:19,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18" (1/1) ... [2020-11-30 01:25:19,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18" (1/1) ... [2020-11-30 01:25:19,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18" (1/1) ... [2020-11-30 01:25:19,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:25:19,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:25:19,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:25:19,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:25:19,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:25:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 01:25:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:25:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 01:25:19,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:25:19,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:25:19,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 01:25:19,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:25:19,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:25:19,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:25:19,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:25:19,752 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:25:19,752 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-11-30 01:25:19,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:25:19 BoogieIcfgContainer [2020-11-30 01:25:19,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:25:19,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:25:19,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:25:19,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:25:19,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:25:18" (1/3) ... [2020-11-30 01:25:19,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75447718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:25:19, skipping insertion in model container [2020-11-30 01:25:19,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:18" (2/3) ... [2020-11-30 01:25:19,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75447718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:25:19, skipping insertion in model container [2020-11-30 01:25:19,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:25:19" (3/3) ... [2020-11-30 01:25:19,765 INFO L111 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2020-11-30 01:25:19,777 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:25:19,783 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:25:19,794 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:25:19,821 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:25:19,822 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:25:19,822 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:25:19,822 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:25:19,822 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:25:19,823 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:25:19,823 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:25:19,823 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:25:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-11-30 01:25:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 01:25:19,866 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:25:19,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:25:19,867 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:25:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:25:19,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1395670938, now seen corresponding path program 1 times [2020-11-30 01:25:19,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:25:19,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018351682] [2020-11-30 01:25:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:25:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:25:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:20,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018351682] [2020-11-30 01:25:20,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:25:20,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:25:20,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849860081] [2020-11-30 01:25:20,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:25:20,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:25:20,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:25:20,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:25:20,234 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2020-11-30 01:25:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:25:20,391 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-11-30 01:25:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:25:20,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-30 01:25:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:25:20,402 INFO L225 Difference]: With dead ends: 54 [2020-11-30 01:25:20,402 INFO L226 Difference]: Without dead ends: 24 [2020-11-30 01:25:20,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:25:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-30 01:25:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-30 01:25:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-30 01:25:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-11-30 01:25:20,453 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2020-11-30 01:25:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:25:20,453 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-30 01:25:20,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:25:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-11-30 01:25:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:25:20,455 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:25:20,455 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:25:20,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:25:20,456 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:25:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:25:20,458 INFO L82 PathProgramCache]: Analyzing trace with hash 884093789, now seen corresponding path program 1 times [2020-11-30 01:25:20,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:25:20,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640452962] [2020-11-30 01:25:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:25:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:25:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:20,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640452962] [2020-11-30 01:25:20,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:25:20,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:25:20,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124574780] [2020-11-30 01:25:20,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:25:20,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:25:20,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:25:20,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:25:20,691 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2020-11-30 01:25:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:25:20,881 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-11-30 01:25:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:25:20,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-11-30 01:25:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:25:20,883 INFO L225 Difference]: With dead ends: 44 [2020-11-30 01:25:20,883 INFO L226 Difference]: Without dead ends: 34 [2020-11-30 01:25:20,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:25:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-30 01:25:20,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2020-11-30 01:25:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-30 01:25:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-11-30 01:25:20,892 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2020-11-30 01:25:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:25:20,892 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-30 01:25:20,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:25:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-11-30 01:25:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:25:20,894 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:25:20,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:25:20,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:25:20,895 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:25:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:25:20,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1693440415, now seen corresponding path program 1 times [2020-11-30 01:25:20,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:25:20,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032700853] [2020-11-30 01:25:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:25:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:25:21,015 ERROR L253 erpolLogProxyWrapper]: Interpolant 18 not inductive [2020-11-30 01:25:21,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:25:21,016 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) 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.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-11-30 01:25:21,025 INFO L168 Benchmark]: Toolchain (without parser) took 2595.13 ms. Allocated memory is still 140.5 MB. Free memory was 107.5 MB in the beginning and 62.5 MB in the end (delta: 45.1 MB). Peak memory consumption was 41.8 MB. Max. memory is 16.1 GB. [2020-11-30 01:25:21,028 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 86.0 MB. Free memory is still 45.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:25:21,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.48 ms. Allocated memory is still 140.5 MB. Free memory was 107.2 MB in the beginning and 103.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:25:21,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.27 ms. Allocated memory is still 140.5 MB. Free memory was 103.0 MB in the beginning and 100.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:25:21,032 INFO L168 Benchmark]: Boogie Preprocessor took 71.81 ms. Allocated memory is still 140.5 MB. Free memory was 100.9 MB in the beginning and 99.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:25:21,035 INFO L168 Benchmark]: RCFGBuilder took 666.35 ms. Allocated memory is still 140.5 MB. Free memory was 99.3 MB in the beginning and 74.8 MB in the end (delta: 24.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:25:21,037 INFO L168 Benchmark]: TraceAbstraction took 1264.30 ms. Allocated memory is still 140.5 MB. Free memory was 74.8 MB in the beginning and 62.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:25:21,048 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.28 ms. Allocated memory is still 86.0 MB. Free memory is still 45.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 525.48 ms. Allocated memory is still 140.5 MB. Free memory was 107.2 MB in the beginning and 103.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.27 ms. Allocated memory is still 140.5 MB. Free memory was 103.0 MB in the beginning and 100.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.81 ms. Allocated memory is still 140.5 MB. Free memory was 100.9 MB in the beginning and 99.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 666.35 ms. Allocated memory is still 140.5 MB. Free memory was 99.3 MB in the beginning and 74.8 MB in the end (delta: 24.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1264.30 ms. Allocated memory is still 140.5 MB. Free memory was 74.8 MB in the beginning and 62.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:25:23,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:25:23,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:25:23,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:25:23,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:25:23,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:25:23,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:25:23,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:25:23,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:25:23,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:25:23,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:25:23,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:25:23,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:25:23,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:25:23,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:25:23,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:25:23,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:25:23,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:25:23,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:25:23,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:25:23,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:25:23,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:25:23,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:25:23,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:25:23,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:25:23,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:25:23,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:25:23,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:25:23,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:25:23,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:25:23,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:25:23,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:25:23,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:25:23,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:25:23,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:25:23,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:25:23,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:25:23,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:25:23,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:25:23,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:25:23,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:25:23,787 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-30 01:25:23,831 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:25:23,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:25:23,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:25:23,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:25:23,835 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:25:23,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:25:23,836 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:25:23,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:25:23,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:25:23,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:25:23,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:25:23,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:25:23,838 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 01:25:23,838 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 01:25:23,838 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:25:23,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:25:23,839 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:25:23,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:25:23,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:25:23,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:25:23,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:25:23,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:25:23,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:25:23,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:25:23,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:25:23,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:25:23,841 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-30 01:25:23,841 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 01:25:23,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:25:23,842 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:25:23,842 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:25:23,842 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-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/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-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04611f7cb9bdc3bfbd4f2358731c54027c595e1d [2020-11-30 01:25:24,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:25:24,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:25:24,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:25:24,317 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:25:24,317 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:25:24,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/../../sv-benchmarks/c/list-properties/list_search-1.i [2020-11-30 01:25:24,415 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/data/02a37ea3e/f6dbd2869b0d46ff8a567523e21d19a1/FLAG9a44f4a24 [2020-11-30 01:25:24,972 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:25:24,973 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/sv-benchmarks/c/list-properties/list_search-1.i [2020-11-30 01:25:24,992 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/data/02a37ea3e/f6dbd2869b0d46ff8a567523e21d19a1/FLAG9a44f4a24 [2020-11-30 01:25:25,287 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/data/02a37ea3e/f6dbd2869b0d46ff8a567523e21d19a1 [2020-11-30 01:25:25,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:25:25,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:25:25,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:25:25,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:25:25,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:25:25,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:25:25" (1/1) ... [2020-11-30 01:25:25,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b0b5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25, skipping insertion in model container [2020-11-30 01:25:25,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:25:25" (1/1) ... [2020-11-30 01:25:25,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:25:25,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:25:25,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:25:25,727 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:25:25,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:25:25,878 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:25:25,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25 WrapperNode [2020-11-30 01:25:25,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:25:25,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:25:25,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:25:25,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:25:25,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25" (1/1) ... [2020-11-30 01:25:25,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25" (1/1) ... [2020-11-30 01:25:25,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:25:25,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:25:25,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:25:25,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:25:25,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25" (1/1) ... [2020-11-30 01:25:25,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25" (1/1) ... [2020-11-30 01:25:25,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25" (1/1) ... [2020-11-30 01:25:25,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25" (1/1) ... [2020-11-30 01:25:25,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25" (1/1) ... [2020-11-30 01:25:25,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25" (1/1) ... [2020-11-30 01:25:25,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25" (1/1) ... [2020-11-30 01:25:25,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:25:25,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:25:25,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:25:25,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:25:25,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:25:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-11-30 01:25:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 01:25:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:25:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:25:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 01:25:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-30 01:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 01:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:25:26,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:25:26,816 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:25:26,816 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-11-30 01:25:26,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:25:26 BoogieIcfgContainer [2020-11-30 01:25:26,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:25:26,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:25:26,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:25:26,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:25:26,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:25:25" (1/3) ... [2020-11-30 01:25:26,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bf78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:25:26, skipping insertion in model container [2020-11-30 01:25:26,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:25:25" (2/3) ... [2020-11-30 01:25:26,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bf78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:25:26, skipping insertion in model container [2020-11-30 01:25:26,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:25:26" (3/3) ... [2020-11-30 01:25:26,828 INFO L111 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2020-11-30 01:25:26,844 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:25:26,849 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:25:26,863 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:25:26,891 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:25:26,892 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:25:26,892 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:25:26,892 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:25:26,892 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:25:26,892 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:25:26,892 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:25:26,892 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:25:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-11-30 01:25:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 01:25:26,909 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:25:26,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:25:26,910 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:25:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:25:26,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1395670938, now seen corresponding path program 1 times [2020-11-30 01:25:26,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:25:26,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295442906] [2020-11-30 01:25:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 01:25:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:25:27,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 1 conjunts are in the unsatisfiable core [2020-11-30 01:25:27,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:25:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:27,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:25:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:27,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295442906] [2020-11-30 01:25:27,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:25:27,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 01:25:27,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977380808] [2020-11-30 01:25:27,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-30 01:25:27,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:25:27,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 01:25:27,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 01:25:27,185 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-11-30 01:25:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:25:27,203 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-11-30 01:25:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 01:25:27,204 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2020-11-30 01:25:27,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:25:27,213 INFO L225 Difference]: With dead ends: 42 [2020-11-30 01:25:27,214 INFO L226 Difference]: Without dead ends: 24 [2020-11-30 01:25:27,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 01:25:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-30 01:25:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-30 01:25:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-30 01:25:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-11-30 01:25:27,252 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 21 [2020-11-30 01:25:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:25:27,253 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-11-30 01:25:27,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-30 01:25:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-11-30 01:25:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:25:27,255 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:25:27,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:25:27,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 01:25:27,473 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:25:27,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:25:27,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1905792029, now seen corresponding path program 1 times [2020-11-30 01:25:27,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:25:27,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228009735] [2020-11-30 01:25:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 01:25:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:25:27,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:25:27,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:25:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:27,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:25:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:27,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228009735] [2020-11-30 01:25:27,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:25:27,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 01:25:27,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98230522] [2020-11-30 01:25:27,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:25:27,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:25:27,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:25:27,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:25:27,708 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 4 states. [2020-11-30 01:25:27,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:25:27,977 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2020-11-30 01:25:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:25:27,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-11-30 01:25:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:25:27,979 INFO L225 Difference]: With dead ends: 42 [2020-11-30 01:25:27,979 INFO L226 Difference]: Without dead ends: 24 [2020-11-30 01:25:27,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:25:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-30 01:25:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-30 01:25:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-30 01:25:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-11-30 01:25:27,987 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 23 [2020-11-30 01:25:27,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:25:27,988 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-30 01:25:27,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:25:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-11-30 01:25:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:25:27,989 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:25:27,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:25:28,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 01:25:28,208 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:25:28,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:25:28,209 INFO L82 PathProgramCache]: Analyzing trace with hash 884093789, now seen corresponding path program 1 times [2020-11-30 01:25:28,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:25:28,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609200058] [2020-11-30 01:25:28,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 01:25:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:25:28,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 01:25:28,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:25:28,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:25:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:28,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:25:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:28,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609200058] [2020-11-30 01:25:28,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:25:28,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 01:25:28,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865272183] [2020-11-30 01:25:28,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:25:28,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:25:28,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:25:28,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:25:28,451 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2020-11-30 01:25:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:25:28,843 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-11-30 01:25:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:25:28,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-11-30 01:25:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:25:28,854 INFO L225 Difference]: With dead ends: 44 [2020-11-30 01:25:28,854 INFO L226 Difference]: Without dead ends: 34 [2020-11-30 01:25:28,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:25:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-30 01:25:28,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2020-11-30 01:25:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-30 01:25:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-11-30 01:25:28,863 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2020-11-30 01:25:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:25:28,863 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-30 01:25:28,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:25:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-11-30 01:25:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:25:28,865 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:25:28,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:25:29,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 01:25:29,071 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:25:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:25:29,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1693440415, now seen corresponding path program 1 times [2020-11-30 01:25:29,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:25:29,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452074777] [2020-11-30 01:25:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-30 01:25:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:25:29,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 01:25:29,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:25:29,391 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-30 01:25:29,391 INFO L384 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 1 case distinctions, treesize of input 22 treesize of output 7 [2020-11-30 01:25:29,391 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:29,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:29,396 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:25:29,396 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2020-11-30 01:25:29,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:25:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:29,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:25:29,582 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_int|], 2=[|v_#memory_int_41|]} [2020-11-30 01:25:29,588 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:25:29,597 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:29,598 INFO L384 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 1 case distinctions, treesize of input 23 treesize of output 8 [2020-11-30 01:25:29,598 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:29,612 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:29,618 INFO L384 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 9 [2020-11-30 01:25:29,619 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:29,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:29,622 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:25:29,623 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:4 [2020-11-30 01:25:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:29,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452074777] [2020-11-30 01:25:29,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:25:29,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2020-11-30 01:25:29,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579968551] [2020-11-30 01:25:29,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 01:25:29,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:25:29,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 01:25:29,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:25:29,660 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 11 states. [2020-11-30 01:25:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:25:30,755 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-11-30 01:25:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:25:30,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-11-30 01:25:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:25:30,758 INFO L225 Difference]: With dead ends: 34 [2020-11-30 01:25:30,758 INFO L226 Difference]: Without dead ends: 27 [2020-11-30 01:25:30,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2020-11-30 01:25:30,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-11-30 01:25:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-11-30 01:25:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-30 01:25:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-11-30 01:25:30,767 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2020-11-30 01:25:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:25:30,768 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-11-30 01:25:30,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 01:25:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-11-30 01:25:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:25:30,769 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:25:30,770 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:25:30,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 01:25:30,991 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:25:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:25:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash 725224280, now seen corresponding path program 1 times [2020-11-30 01:25:30,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:25:30,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312752998] [2020-11-30 01:25:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-30 01:25:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:25:31,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:25:31,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:25:31,223 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:25:31,223 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:31,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:31,237 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:25:31,237 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2020-11-30 01:25:31,321 INFO L384 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 16 treesize of output 8 [2020-11-30 01:25:31,322 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:31,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:31,325 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:25:31,325 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2020-11-30 01:25:31,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:25:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:31,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:25:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:31,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312752998] [2020-11-30 01:25:31,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:25:31,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2020-11-30 01:25:31,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567082519] [2020-11-30 01:25:31,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 01:25:31,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:25:31,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 01:25:31,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:25:31,501 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 13 states. [2020-11-30 01:25:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:25:32,429 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-11-30 01:25:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:25:32,431 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-11-30 01:25:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:25:32,432 INFO L225 Difference]: With dead ends: 47 [2020-11-30 01:25:32,432 INFO L226 Difference]: Without dead ends: 37 [2020-11-30 01:25:32,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:25:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-30 01:25:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2020-11-30 01:25:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-11-30 01:25:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-11-30 01:25:32,446 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2020-11-30 01:25:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:25:32,446 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-11-30 01:25:32,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 01:25:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-11-30 01:25:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:25:32,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:25:32,449 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:25:32,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 01:25:32,663 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:25:32,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:25:32,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1534570906, now seen corresponding path program 1 times [2020-11-30 01:25:32,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:25:32,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609050681] [2020-11-30 01:25:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-30 01:25:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:25:32,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2020-11-30 01:25:32,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:25:32,880 INFO L384 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 [2020-11-30 01:25:32,880 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:32,893 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:32,894 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:25:32,894 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 01:25:32,948 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-30 01:25:32,948 INFO L384 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 1 case distinctions, treesize of input 22 treesize of output 7 [2020-11-30 01:25:32,948 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:32,956 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:32,957 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:25:32,957 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2020-11-30 01:25:33,032 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:33,033 INFO L384 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 13 treesize of output 17 [2020-11-30 01:25:33,033 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:33,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:33,059 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 01:25:33,060 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:33,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:33,074 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:25:33,075 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2020-11-30 01:25:33,133 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_50|], 10=[|v_#memory_int_49|]} [2020-11-30 01:25:33,145 INFO L384 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 [2020-11-30 01:25:33,146 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:33,181 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:33,190 INFO L384 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 [2020-11-30 01:25:33,190 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:33,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:33,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:25:33,229 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2020-11-30 01:25:33,231 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:33,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:33,247 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:25:33,247 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:67, output treesize:33 [2020-11-30 01:25:33,414 INFO L384 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 25 treesize of output 17 [2020-11-30 01:25:33,415 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:33,429 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:33,432 INFO L384 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 29 treesize of output 17 [2020-11-30 01:25:33,433 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:33,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:33,448 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:25:33,448 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:15 [2020-11-30 01:25:33,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:25:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:33,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:25:33,820 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:25:33,837 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:33,838 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:25:33,838 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2020-11-30 01:25:35,943 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_20 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_16|) (_ bv0 1))) (not (= (bvadd (select (select (store |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_16| (store (store (select |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_16|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_20) (_ bv4 32) v_DerPreprocessor_1)) c_~head~0.base) c_~head~0.offset) (_ bv4294967294 32)) (_ bv0 32))))) is different from false [2020-11-30 01:25:37,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_20 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_16|) (_ bv0 1))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_16| (store (store (select |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_16|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_20) (_ bv4 32) v_DerPreprocessor_1)) c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset))))) is different from false [2020-11-30 01:25:37,992 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_int|], 4=[|v_#memory_int_52|]} [2020-11-30 01:25:38,005 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:25:38,015 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:38,016 INFO L384 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 1 case distinctions, treesize of input 23 treesize of output 8 [2020-11-30 01:25:38,016 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:25:38,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:25:38,050 INFO L384 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 83 treesize of output 75 [2020-11-30 01:25:38,051 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-30 01:25:38,221 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-11-30 01:25:38,221 INFO L625 ElimStorePlain]: treesize reduction 22, result has 71.4 percent of original size [2020-11-30 01:25:38,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,240 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:25:38,240 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:49, output treesize:55 [2020-11-30 01:25:38,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:25:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:38,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609050681] [2020-11-30 01:25:38,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:25:38,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2020-11-30 01:25:38,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478417078] [2020-11-30 01:25:38,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 01:25:38,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:25:38,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 01:25:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=237, Unknown=2, NotChecked=62, Total=342 [2020-11-30 01:25:38,367 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 19 states. [2020-11-30 01:26:01,543 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) (select (select |c_#memory_int| c_~head~0.base) c_~head~0.offset)) (forall ((v_DerPreprocessor_1 (_ BitVec 32))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base (store (store (select |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset c_ULTIMATE.start_insert_list_~k) (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32)) v_DerPreprocessor_1)) c_~head~0.base) c_~head~0.offset)))) (forall ((v_DerPreprocessor_1 (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_20 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_16|) (_ bv0 1))) (not (= (bvadd (select (select (store |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_16| (store (store (select |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_16|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_20) (_ bv4 32) v_DerPreprocessor_1)) c_~head~0.base) c_~head~0.offset) (_ bv4294967294 32)) (_ bv0 32))))) (= (bvadd c_ULTIMATE.start_insert_list_~k (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) (select (select |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset)) (= (bvadd (select |c_#valid| c_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| c_ULTIMATE.start_insert_list_~l.base) (_ bv1 1)) (_ bv0 1))) is different from false [2020-11-30 01:26:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:26:02,244 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-11-30 01:26:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:26:02,249 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2020-11-30 01:26:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:26:02,250 INFO L225 Difference]: With dead ends: 37 [2020-11-30 01:26:02,250 INFO L226 Difference]: Without dead ends: 30 [2020-11-30 01:26:02,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=89, Invalid=426, Unknown=3, NotChecked=132, Total=650 [2020-11-30 01:26:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-11-30 01:26:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-11-30 01:26:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-30 01:26:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-11-30 01:26:02,266 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2020-11-30 01:26:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:26:02,267 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-11-30 01:26:02,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 01:26:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-11-30 01:26:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 01:26:02,274 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:02,274 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:26:02,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 01:26:02,487 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:26:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:02,488 INFO L82 PathProgramCache]: Analyzing trace with hash 897641853, now seen corresponding path program 2 times [2020-11-30 01:26:02,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:26:02,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134344949] [2020-11-30 01:26:02,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-30 01:26:02,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 01:26:02,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:26:02,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 29 conjunts are in the unsatisfiable core [2020-11-30 01:26:02,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:26:02,857 INFO L384 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 [2020-11-30 01:26:02,858 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:02,868 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:02,869 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:02,869 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2020-11-30 01:26:02,893 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:26:02,893 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:02,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:02,903 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:02,903 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-11-30 01:26:02,979 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:02,979 INFO L384 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 13 treesize of output 17 [2020-11-30 01:26:02,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:26:02,994 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:03,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:03,030 INFO L384 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 26 treesize of output 14 [2020-11-30 01:26:03,030 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:03,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:03,045 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:03,045 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:21 [2020-11-30 01:26:03,085 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_54|], 2=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.base_56|]} [2020-11-30 01:26:03,096 INFO L384 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 [2020-11-30 01:26:03,097 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:03,141 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:03,163 INFO L384 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 24 treesize of output 12 [2020-11-30 01:26:03,163 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:03,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:03,195 INFO L384 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 22 treesize of output 21 [2020-11-30 01:26:03,196 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:03,216 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:03,217 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:03,217 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2020-11-30 01:26:03,393 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-30 01:26:03,393 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:03,416 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:03,417 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:03,418 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2020-11-30 01:26:03,504 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:03,505 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-11-30 01:26:03,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:26:03,508 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:03,512 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:03,512 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:03,512 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:4 [2020-11-30 01:26:03,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:26:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:26:03,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:26:03,832 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:03,837 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:03,838 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:03,838 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:23 [2020-11-30 01:26:03,984 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:04,014 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:04,016 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:04,016 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:28 [2020-11-30 01:26:06,027 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_18|))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_18|) (_ bv0 32) v_DerPreprocessor_2) (_ bv4 32) c_~head~0.base)) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))) (_ bv0 32))))) is different from false [2020-11-30 01:26:08,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_18| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_18|) (_ bv0 32) v_DerPreprocessor_2) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.base)) c_ULTIMATE.start_insert_list_~l.base) (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_18|))))) is different from false [2020-11-30 01:26:08,083 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 01:26:08,182 INFO L625 ElimStorePlain]: treesize reduction 26, result has 70.8 percent of original size [2020-11-30 01:26:08,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:08,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:08,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:08,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:08,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:08,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:08,189 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:08,189 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:63 [2020-11-30 01:26:08,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:08,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:08,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:08,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:08,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:08,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:10,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:26:10,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134344949] [2020-11-30 01:26:10,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:26:10,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2020-11-30 01:26:10,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160414465] [2020-11-30 01:26:10,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 01:26:10,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:26:10,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 01:26:10,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=337, Unknown=3, NotChecked=74, Total=462 [2020-11-30 01:26:10,333 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 22 states. [2020-11-30 01:26:13,960 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_list_~l.base) .cse1))) (and (not (= (_ bv0 32) c_~head~0.base)) (not (= (_ bv0 32) .cse0)) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_list_~l.base) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| .cse0) (_ bv4 32)))) (= c_ULTIMATE.start_insert_list_~l.offset (_ bv0 32)) (= (_ bv0 32) c_~head~0.offset) (= (bvadd (select |c_#valid| c_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| c_ULTIMATE.start_insert_list_~l.base) (_ bv1 1)) (_ bv0 1)) (not (= c_ULTIMATE.start_insert_list_~l.base c_~head~0.base)) (not (= .cse0 c_ULTIMATE.start_insert_list_~l.base)) (forall ((v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_18| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_18|) (_ bv0 32) v_DerPreprocessor_2) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.base)) c_ULTIMATE.start_insert_list_~l.base) (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_18|))))) (not (= (_ bv0 32) c_ULTIMATE.start_insert_list_~l.base))))) is different from false [2020-11-30 01:26:16,664 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2020-11-30 01:26:16,971 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2020-11-30 01:26:19,262 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2020-11-30 01:26:21,580 WARN L193 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-11-30 01:26:21,955 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2020-11-30 01:26:22,197 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2020-11-30 01:26:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:26:22,253 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-11-30 01:26:22,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 01:26:22,254 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2020-11-30 01:26:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:26:22,255 INFO L225 Difference]: With dead ends: 50 [2020-11-30 01:26:22,255 INFO L226 Difference]: Without dead ends: 40 [2020-11-30 01:26:22,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=199, Invalid=865, Unknown=4, NotChecked=192, Total=1260 [2020-11-30 01:26:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-11-30 01:26:22,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2020-11-30 01:26:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-30 01:26:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-11-30 01:26:22,266 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2020-11-30 01:26:22,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:26:22,267 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-11-30 01:26:22,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 01:26:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-11-30 01:26:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 01:26:22,270 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:22,270 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:26:22,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 01:26:22,486 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:26:22,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1706988479, now seen corresponding path program 2 times [2020-11-30 01:26:22,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:26:22,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351999360] [2020-11-30 01:26:22,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-11-30 01:26:22,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 01:26:22,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:26:22,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 45 conjunts are in the unsatisfiable core [2020-11-30 01:26:22,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:26:22,783 INFO L384 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 [2020-11-30 01:26:22,784 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:22,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:22,790 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:22,790 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 01:26:22,823 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-30 01:26:22,824 INFO L384 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 1 case distinctions, treesize of input 22 treesize of output 7 [2020-11-30 01:26:22,824 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:22,830 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:22,830 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:22,830 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2020-11-30 01:26:22,901 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:22,901 INFO L384 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 19 treesize of output 41 [2020-11-30 01:26:22,902 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:22,968 INFO L625 ElimStorePlain]: treesize reduction 14, result has 72.0 percent of original size [2020-11-30 01:26:22,982 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 01:26:22,983 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:23,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:23,007 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:23,007 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2020-11-30 01:26:23,051 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_65|, |v_#memory_$Pointer$.offset_61|], 10=[|v_#memory_int_62|]} [2020-11-30 01:26:23,062 INFO L384 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 [2020-11-30 01:26:23,062 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:23,108 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:23,131 INFO L384 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 [2020-11-30 01:26:23,131 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:23,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:23,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:26:23,187 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2020-11-30 01:26:23,189 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:23,219 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:23,220 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:23,220 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:81, output treesize:53 [2020-11-30 01:26:23,391 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:23,391 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2020-11-30 01:26:23,392 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:23,517 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-11-30 01:26:23,517 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:23,529 INFO L384 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 55 treesize of output 31 [2020-11-30 01:26:23,529 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:23,586 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:23,594 INFO L384 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 35 treesize of output 23 [2020-11-30 01:26:23,594 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:23,631 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:23,637 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2020-11-30 01:26:23,638 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:23,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:23,661 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:23,661 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:102, output treesize:57 [2020-11-30 01:26:23,837 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_68|, |v_#memory_$Pointer$.base_66|, |v_#memory_$Pointer$.offset_64|, |v_#memory_$Pointer$.offset_62|], 10=[|v_#memory_int_64|]} [2020-11-30 01:26:23,897 INFO L384 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 49 treesize of output 29 [2020-11-30 01:26:23,898 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:24,093 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-11-30 01:26:24,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:24,105 INFO L384 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 47 treesize of output 38 [2020-11-30 01:26:24,106 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:24,324 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-11-30 01:26:24,325 INFO L625 ElimStorePlain]: treesize reduction 4, result has 96.2 percent of original size [2020-11-30 01:26:24,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:26:24,348 INFO L384 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 33 treesize of output 21 [2020-11-30 01:26:24,348 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:24,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:24,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:26:24,414 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2020-11-30 01:26:24,415 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:24,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:24,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:26:24,458 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2020-11-30 01:26:24,463 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:24,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:24,486 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:24,486 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:123, output treesize:76 [2020-11-30 01:26:24,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:26:24,791 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:24,791 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 48 [2020-11-30 01:26:24,792 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:24,808 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:24,818 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:24,818 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 30 [2020-11-30 01:26:24,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:26:24,855 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:24,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:24,877 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:26:24,878 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:13 [2020-11-30 01:26:24,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:26:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:26:24,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:26:25,446 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_int_65|], 3=[|v_#memory_$Pointer$.base_66|, |v_#memory_$Pointer$.offset_62|]} [2020-11-30 01:26:25,450 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:25,563 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-11-30 01:26:25,563 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:25,566 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:25,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:25,640 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:25,659 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:25,660 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:25,660 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:96, output treesize:59 [2020-11-30 01:26:25,887 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:25,981 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:25,983 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:26,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:26,028 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:26,029 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:94, output treesize:62 [2020-11-30 01:26:28,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_25 (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 1))) (not (= (_ bv2 32) (let ((.cse0 (bvadd c_~head~0.offset (_ bv4 32)))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_DerPreprocessor_5) (_ bv4 32) c_~head~0.base)) c_~head~0.base) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_DerPreprocessor_6) (_ bv4 32) c_~head~0.offset)) c_~head~0.base) .cse0))))))) is different from false [2020-11-30 01:26:30,093 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_25 (_ BitVec 32))) (or (not (= (_ bv2 32) (let ((.cse0 (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32)))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_DerPreprocessor_5) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.base)) c_ULTIMATE.start_insert_list_~l.base) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_DerPreprocessor_6) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.offset)) c_ULTIMATE.start_insert_list_~l.base) .cse0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 1))))) is different from false [2020-11-30 01:26:30,129 INFO L441 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.base_65|, |v_#memory_$Pointer$.offset_61|], 4=[|v_#memory_int_67|]} [2020-11-30 01:26:30,192 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 01:26:31,602 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2020-11-30 01:26:31,602 INFO L625 ElimStorePlain]: treesize reduction 390, result has 38.3 percent of original size [2020-11-30 01:26:31,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:26:31,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:26:31,611 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:31,690 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-11-30 01:26:31,954 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-11-30 01:26:31,954 INFO L625 ElimStorePlain]: treesize reduction 82, result has 55.2 percent of original size [2020-11-30 01:26:31,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:26:31,960 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:26:31,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:26:31,962 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:32,509 WARN L193 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2020-11-30 01:26:32,510 INFO L625 ElimStorePlain]: treesize reduction 41, result has 76.2 percent of original size [2020-11-30 01:26:32,514 INFO L545 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-11-30 01:26:32,927 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-30 01:26:32,927 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:32,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:32,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:32,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:32,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:26:32,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:32,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:32,955 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:32,956 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:123, output treesize:186 [2020-11-30 01:26:32,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:32,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:32,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:32,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:26:32,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:32,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:35,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_25 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (let ((.cse8 (= c_ULTIMATE.start_insert_list_~l.base |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|))) (let ((.cse0 (not .cse8)) (.cse2 (store (select |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset c_ULTIMATE.start_insert_list_~k)) (.cse3 (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32))) (.cse4 (= (_ bv0 32) c_ULTIMATE.start_insert_list_~l.offset))) (and (or .cse0 (not (= (_ bv2 32) (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base (store .cse2 .cse3 v_DerPreprocessor_9)))) (store .cse1 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select .cse1 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4))) c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset))) (not .cse4)) (or (let ((.cse6 (= (_ bv4294967292 32) c_ULTIMATE.start_insert_list_~l.offset))) (and (or (not (= (_ bv2 32) (select (select (let ((.cse5 (store |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base (store .cse2 .cse3 v_prenex_1)))) (store .cse5 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select .cse5 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4))) v_DerPreprocessor_5) v_DerPreprocessor_6))) (not .cse6) .cse0) (or (not (= (_ bv2 32) (select (select (let ((.cse7 (store |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base (store .cse2 .cse3 v_prenex_2)))) (store .cse7 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select .cse7 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4))) c_~head~0.base) c_~head~0.offset))) (and .cse6 .cse8)))) (and .cse8 .cse4))))) (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 1))))) is different from false [2020-11-30 01:26:35,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:37,072 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_26 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_22| (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_25 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv2 32) (select (select (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22| (store (store (select |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_26) (_ bv4 32) v_prenex_2)))) (store .cse0 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select .cse0 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4))) c_~head~0.base) c_~head~0.offset))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22| (_ bv1 1)) |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 1))) (= |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22|) (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22|) (_ bv0 1))))) is different from false [2020-11-30 01:26:39,118 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_26 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_22| (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_25 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22| (_ bv1 1)) |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 1))) (= |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22|) (not (= (bvadd (select (select (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22| (store (store (select |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_26) (_ bv4 32) v_prenex_2)))) (store .cse0 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select .cse0 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4))) c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset) (_ bv4294967294 32)) (_ bv0 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22|) (_ bv0 1))))) is different from false [2020-11-30 01:26:39,158 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_int|], 6=[|v_#memory_int_69|]} [2020-11-30 01:26:39,178 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:26:39,196 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:26:39,196 INFO L384 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 1 case distinctions, treesize of input 23 treesize of output 8 [2020-11-30 01:26:39,196 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:26:39,342 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-11-30 01:26:39,343 INFO L625 ElimStorePlain]: treesize reduction 3, result has 95.7 percent of original size [2020-11-30 01:26:39,354 INFO L384 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 379 treesize of output 371 [2020-11-30 01:26:39,355 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-30 01:26:39,802 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2020-11-30 01:26:39,803 INFO L625 ElimStorePlain]: treesize reduction 264, result has 30.9 percent of original size [2020-11-30 01:26:39,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:26:39,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,881 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-11-30 01:26:39,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:26:39,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,884 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-11-30 01:26:39,884 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:26:39,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,887 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2020-11-30 01:26:39,887 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:85, output treesize:118 [2020-11-30 01:26:39,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:26:39,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:26:39,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,945 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:26:39,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:26:39,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:39,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:39,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:26:40,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:40,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:26:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:26:40,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351999360] [2020-11-30 01:26:40,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:26:40,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2020-11-30 01:26:40,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330178079] [2020-11-30 01:26:40,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-30 01:26:40,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:26:40,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-30 01:26:40,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=418, Unknown=5, NotChecked=220, Total=702 [2020-11-30 01:26:40,233 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 27 states. [2020-11-30 01:27:13,493 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (not (= (bvadd (let ((.cse0 (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32))) (.cse1 (bvadd c_~head~0.offset (_ bv4 32)))) (select (select (store |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base (store (store (select |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset c_ULTIMATE.start_insert_list_~k) .cse0 v_DerPreprocessor_4)) (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_list_~l.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset v_DerPreprocessor_5) .cse0 c_~head~0.base)) c_~head~0.base) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_list_~l.base (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset v_DerPreprocessor_6) .cse0 c_~head~0.offset)) c_~head~0.base) .cse1))) (_ bv4294967294 32)) (_ bv0 32)))) (= (_ bv5 32) (select (select |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset)) (= (_ bv5 32) (select (select |c_#memory_int| c_~head~0.base) c_~head~0.offset)) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_26 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_22| (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_25 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv2 32) (select (select (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22| (store (store (select |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_26) (_ bv4 32) v_prenex_2)))) (store .cse2 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select .cse2 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4))) c_~head~0.base) c_~head~0.offset))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22| (_ bv1 1)) |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 1))) (= |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22|) (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_22|) (_ bv0 1))))) (= (bvadd c_ULTIMATE.start_insert_list_~k (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd (select |c_#valid| c_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| c_ULTIMATE.start_insert_list_~l.base) (_ bv1 1)) (_ bv0 1))) is different from false [2020-11-30 01:27:15,560 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_insert_list_~k (select (select |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset)) (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_25 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (let ((.cse8 (= c_ULTIMATE.start_insert_list_~l.base |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|))) (let ((.cse0 (not .cse8)) (.cse2 (store (select |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset c_ULTIMATE.start_insert_list_~k)) (.cse3 (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32))) (.cse4 (= (_ bv0 32) c_ULTIMATE.start_insert_list_~l.offset))) (and (or .cse0 (not (= (_ bv2 32) (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base (store .cse2 .cse3 v_DerPreprocessor_9)))) (store .cse1 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select .cse1 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4))) c_ULTIMATE.start_insert_list_~l.base) c_ULTIMATE.start_insert_list_~l.offset))) (not .cse4)) (or (let ((.cse6 (= (_ bv4294967292 32) c_ULTIMATE.start_insert_list_~l.offset))) (and (or (not (= (_ bv2 32) (select (select (let ((.cse5 (store |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base (store .cse2 .cse3 v_prenex_1)))) (store .cse5 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select .cse5 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4))) v_DerPreprocessor_5) v_DerPreprocessor_6))) (not .cse6) .cse0) (or (not (= (_ bv2 32) (select (select (let ((.cse7 (store |c_#memory_int| c_ULTIMATE.start_insert_list_~l.base (store .cse2 .cse3 v_prenex_2)))) (store .cse7 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select .cse7 |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4))) c_~head~0.base) c_~head~0.offset))) (and .cse6 .cse8)))) (and .cse8 .cse4))))) (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 1))))) (= (_ bv5 32) (select (select |c_#memory_int| c_~head~0.base) c_~head~0.offset)) (= c_ULTIMATE.start_insert_list_~l.offset (_ bv0 32)) (= (bvadd (select |c_#valid| c_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| c_ULTIMATE.start_insert_list_~l.base) (_ bv1 1)) (_ bv0 1)) (not (= c_ULTIMATE.start_insert_list_~l.base c_~head~0.base))) is different from false [2020-11-30 01:27:17,591 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_list_~l.base) .cse2))) (and (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_25 (_ BitVec 32))) (or (not (= (_ bv2 32) (let ((.cse0 (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32)))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_DerPreprocessor_5) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.base)) c_ULTIMATE.start_insert_list_~l.base) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_DerPreprocessor_6) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.offset)) c_ULTIMATE.start_insert_list_~l.base) .cse0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 1))))) (not (= .cse1 c_ULTIMATE.start_insert_list_~l.base)) (= (bvadd (select (select |c_#memory_int| .cse1) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_list_~l.base) .cse2)) (_ bv4294967291 32)) (_ bv0 32)) (= c_ULTIMATE.start_insert_list_~l.offset (_ bv0 32)) (= (bvadd (select |c_#valid| .cse1) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| c_ULTIMATE.start_insert_list_~l.base) (_ bv1 1)) (_ bv0 1))))) is different from false [2020-11-30 01:27:19,611 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~head~0.base) .cse1))) (and (= (_ bv5 32) (select (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| c_~head~0.base) .cse1))) (not (= .cse0 c_~head~0.base)) (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (_ BitVec 32)) (v_ULTIMATE.start_insert_list_~k_25 (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 1))) (not (= (_ bv2 32) (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_int| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_ULTIMATE.start_insert_list_~k_25) (_ bv4 32) v_DerPreprocessor_4)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_DerPreprocessor_5) (_ bv4 32) c_~head~0.base)) c_~head~0.base) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_21|) (_ bv0 32) v_DerPreprocessor_6) (_ bv4 32) c_~head~0.offset)) c_~head~0.base) .cse2))))))) (= (bvadd (select |c_#valid| .cse0) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) c_~head~0.offset) (= (bvadd (select |c_#valid| c_~head~0.base) (_ bv1 1)) (_ bv0 1))))) is different from false [2020-11-30 01:27:21,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:21,374 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-11-30 01:27:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:27:21,376 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2020-11-30 01:27:21,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:21,377 INFO L225 Difference]: With dead ends: 40 [2020-11-30 01:27:21,377 INFO L226 Difference]: Without dead ends: 33 [2020-11-30 01:27:21,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=122, Invalid=717, Unknown=9, NotChecked=558, Total=1406 [2020-11-30 01:27:21,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-11-30 01:27:21,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-11-30 01:27:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-11-30 01:27:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-11-30 01:27:21,387 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2020-11-30 01:27:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:21,387 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-11-30 01:27:21,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-30 01:27:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-11-30 01:27:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 01:27:21,388 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:21,389 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:21,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 01:27:21,608 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:27:21,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:21,609 INFO L82 PathProgramCache]: Analyzing trace with hash 608673080, now seen corresponding path program 3 times [2020-11-30 01:27:21,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:27:21,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711767796] [2020-11-30 01:27:21,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-11-30 01:27:21,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-30 01:27:21,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:27:21,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 44 conjunts are in the unsatisfiable core [2020-11-30 01:27:21,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:21,962 INFO L384 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 [2020-11-30 01:27:21,962 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:21,970 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:21,970 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:21,970 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2020-11-30 01:27:21,989 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:27:21,989 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,001 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,001 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-11-30 01:27:22,070 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,070 INFO L384 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 19 treesize of output 41 [2020-11-30 01:27:22,071 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,128 INFO L625 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2020-11-30 01:27:22,144 INFO L384 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 26 treesize of output 14 [2020-11-30 01:27:22,144 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,160 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,160 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:31 [2020-11-30 01:27:22,196 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_71|], 2=[|v_#memory_$Pointer$.base_79|, |v_#memory_$Pointer$.base_76|]} [2020-11-30 01:27:22,205 INFO L384 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 [2020-11-30 01:27:22,205 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,257 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,269 INFO L384 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 24 treesize of output 12 [2020-11-30 01:27:22,269 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,294 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,298 INFO L384 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 22 treesize of output 21 [2020-11-30 01:27:22,299 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,349 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,350 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,350 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:71, output treesize:57 [2020-11-30 01:27:22,473 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,473 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2020-11-30 01:27:22,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:27:22,509 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,572 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,574 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_73|], 6=[|v_#memory_$Pointer$.base_80|]} [2020-11-30 01:27:22,581 INFO L384 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 25 treesize of output 13 [2020-11-30 01:27:22,581 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,627 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:27:22,634 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,634 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2020-11-30 01:27:22,635 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,692 INFO L625 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2020-11-30 01:27:22,692 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,693 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:95, output treesize:54 [2020-11-30 01:27:22,758 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_74|, |v_#memory_$Pointer$.base_77|, |v_#memory_$Pointer$.offset_72|], 5=[|v_#memory_$Pointer$.base_81|]} [2020-11-30 01:27:22,780 INFO L384 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 [2020-11-30 01:27:22,780 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,870 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,874 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:22,931 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,938 INFO L384 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 21 treesize of output 20 [2020-11-30 01:27:22,938 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:22,975 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:22,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:22,982 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:27:23,016 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:23,016 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 70 [2020-11-30 01:27:23,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:27:23,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:27:23,035 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:23,107 INFO L625 ElimStorePlain]: treesize reduction 75, result has 46.0 percent of original size [2020-11-30 01:27:23,108 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:23,109 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:78 [2020-11-30 01:27:23,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:23,444 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:23,444 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 36 [2020-11-30 01:27:23,445 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:23,475 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:23,476 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:23,476 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2020-11-30 01:27:23,649 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:23,649 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 46 [2020-11-30 01:27:23,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:27:23,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:27:23,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:27:23,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:27:23,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:27:23,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:27:23,658 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:23,703 INFO L625 ElimStorePlain]: treesize reduction 20, result has 45.9 percent of original size [2020-11-30 01:27:23,705 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:23,705 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:4 [2020-11-30 01:27:23,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:27:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:23,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:27:24,274 INFO L441 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.offset_72|], 8=[|v_#memory_$Pointer$.base_77|]} [2020-11-30 01:27:24,282 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:24,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:24,322 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:24,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:24,335 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:24,335 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:61 [2020-11-30 01:27:26,681 INFO L441 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_76|], 10=[|v_#memory_$Pointer$.base_83|]} [2020-11-30 01:27:26,683 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,738 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,740 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,762 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:26,762 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:94, output treesize:62 [2020-11-30 01:27:28,825 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_11 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|))) (not (= (_ bv0 32) (let ((.cse1 (bvadd c_~head~0.offset (_ bv4 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 32) v_DerPreprocessor_12) (_ bv4 32) c_~head~0.base)))) (select .cse0 (select (select .cse0 c_~head~0.base) .cse1))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 32) v_DerPreprocessor_11) (_ bv4 32) c_~head~0.offset)) c_~head~0.base) .cse1) (_ bv4 32)))))))) is different from false [2020-11-30 01:27:30,875 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_11 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|))) (not (= (_ bv0 32) (let ((.cse1 (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 32) v_DerPreprocessor_12) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.base)))) (select .cse0 (select (select .cse0 c_ULTIMATE.start_insert_list_~l.base) .cse1))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 32) v_DerPreprocessor_11) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.offset)) c_ULTIMATE.start_insert_list_~l.base) .cse1) (_ bv4 32)))))))) is different from false [2020-11-30 01:27:30,891 INFO L441 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.offset_71|], 12=[|v_#memory_$Pointer$.base_76|]} [2020-11-30 01:27:30,907 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 01:27:31,871 WARN L193 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-11-30 01:27:31,872 INFO L625 ElimStorePlain]: treesize reduction 100, result has 75.1 percent of original size [2020-11-30 01:27:31,875 INFO L545 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-11-30 01:27:32,490 WARN L193 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-11-30 01:27:32,491 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:32,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:32,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:32,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:32,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:32,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:32,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:27:32,503 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:32,503 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:138, output treesize:321 [2020-11-30 01:27:32,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:32,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:32,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:32,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:32,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:32,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:27:34,532 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_4 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|))) (let ((.cse9 (= c_ULTIMATE.start_insert_list_~l.base |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|))) (let ((.cse5 (not .cse9)) (.cse3 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_list_~l.base)) (.cse1 (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32))) (.cse4 (= (_ bv4294967292 32) c_ULTIMATE.start_insert_list_~l.offset))) (and (or (not (= (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_list_~l.base (store (store .cse3 c_ULTIMATE.start_insert_list_~l.offset v_prenex_4) .cse1 c_~head~0.base)))) (store .cse2 |v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (store (store (select .cse2 |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 32) v_DerPreprocessor_12) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.base))))) (select .cse0 (select (select .cse0 c_ULTIMATE.start_insert_list_~l.base) .cse1))) (bvadd v_DerPreprocessor_11 (_ bv4 32))) (_ bv0 32))) (not .cse4) .cse5) (or (let ((.cse8 (= (_ bv0 32) c_ULTIMATE.start_insert_list_~l.offset))) (and (or (not (= (_ bv0 32) (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_list_~l.base (store (store .cse3 c_ULTIMATE.start_insert_list_~l.offset v_DerPreprocessor_15) .cse1 c_~head~0.base)))) (store .cse7 |v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (store (store (select .cse7 |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 32) v_DerPreprocessor_12) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.base))))) (select .cse6 (select (select .cse6 c_ULTIMATE.start_insert_list_~l.base) .cse1))) .cse1))) .cse5 (not .cse8)) (or (and .cse9 .cse8) (not (= (_ bv0 32) (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_list_~l.base (store (store .cse3 c_ULTIMATE.start_insert_list_~l.offset v_prenex_3) .cse1 c_~head~0.base)))) (store .cse11 |v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (store (store (select .cse11 |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 32) v_DerPreprocessor_12) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.base))))) (select .cse10 (select (select .cse10 c_ULTIMATE.start_insert_list_~l.base) .cse1))) (bvadd c_~head~0.offset (_ bv4 32)))))))) (and .cse4 .cse9))))))) is different from false [2020-11-30 01:27:34,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:34,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:34,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:34,561 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:34,636 INFO L625 ElimStorePlain]: treesize reduction 3, result has 97.0 percent of original size [2020-11-30 01:27:34,637 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:34,637 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:115, output treesize:96 [2020-11-30 01:27:36,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_insert_list_#t~malloc8.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_25| (_ bv1 1)) |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_25|))) (not (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_25| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_25|) (_ bv0 32) v_prenex_3) (_ bv4 32) c_~head~0.base)))) (store .cse1 |v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (store (store (select .cse1 |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 32) v_DerPreprocessor_12) (_ bv4 32) |v_ULTIMATE.start_insert_list_#t~malloc8.base_25|))))) (select .cse0 (select (select .cse0 |v_ULTIMATE.start_insert_list_#t~malloc8.base_25|) (_ bv4 32)))) (bvadd c_~head~0.offset (_ bv4 32))) (_ bv0 32))))) is different from false [2020-11-30 01:27:38,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_insert_list_#t~malloc8.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (or (not (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_25| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_25|) (_ bv0 32) v_prenex_3) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.base)))) (store .cse1 |v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (store (store (select .cse1 |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 32) v_DerPreprocessor_12) (_ bv4 32) |v_ULTIMATE.start_insert_list_#t~malloc8.base_25|))))) (select .cse0 (select (select .cse0 |v_ULTIMATE.start_insert_list_#t~malloc8.base_25|) (_ bv4 32)))) (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32))) (_ bv0 32))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_25| (_ bv1 1)) |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_25|))))) is different from false [2020-11-30 01:27:38,709 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:27:38,719 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 01:27:39,365 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 55 [2020-11-30 01:27:39,365 INFO L625 ElimStorePlain]: treesize reduction 6526, result has 1.9 percent of original size [2020-11-30 01:27:39,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:39,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:39,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:39,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:39,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:39,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:39,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:39,377 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:39,377 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:176, output treesize:124 [2020-11-30 01:27:39,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:39,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:39,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:39,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:39,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:39,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:39,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:27:41,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:41,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:41,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711767796] [2020-11-30 01:27:41,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:41,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2020-11-30 01:27:41,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202227949] [2020-11-30 01:27:41,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-11-30 01:27:41,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:27:41,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-30 01:27:41,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=547, Unknown=7, NotChecked=250, Total=870 [2020-11-30 01:27:41,611 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 30 states. [2020-11-30 01:28:12,006 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2020-11-30 01:28:22,931 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_list_~l.base) .cse3))) (and (forall ((v_DerPreprocessor_11 (_ BitVec 32)) (|v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|))) (not (= (_ bv0 32) (let ((.cse1 (bvadd c_ULTIMATE.start_insert_list_~l.offset (_ bv4 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 32) v_DerPreprocessor_12) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.base)))) (select .cse0 (select (select .cse0 c_ULTIMATE.start_insert_list_~l.base) .cse1))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_insert_list_#t~malloc8.base_24|) (_ bv0 32) v_DerPreprocessor_11) (_ bv4 32) c_ULTIMATE.start_insert_list_~l.offset)) c_ULTIMATE.start_insert_list_~l.base) .cse1) (_ bv4 32)))))))) (not (= (_ bv0 32) c_~head~0.base)) (not (= (_ bv0 32) .cse2)) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_list_~l.base) .cse3) (_ bv0 32)) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| .cse2) (_ bv4 32)))) (= c_ULTIMATE.start_insert_list_~l.offset (_ bv0 32)) (= (_ bv0 32) c_~head~0.offset) (= (bvadd (select |c_#valid| c_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| c_ULTIMATE.start_insert_list_~l.base) (_ bv1 1)) (_ bv0 1)) (not (= c_ULTIMATE.start_insert_list_~l.base c_~head~0.base)) (not (= .cse2 c_ULTIMATE.start_insert_list_~l.base)) (= (bvadd (select |c_#valid| .cse2) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) c_ULTIMATE.start_insert_list_~l.base))))) is different from false [2020-11-30 01:28:27,779 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-11-30 01:28:28,164 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-30 01:28:30,636 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-30 01:28:33,219 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-30 01:28:36,028 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-30 01:28:36,701 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-30 01:28:37,137 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-11-30 01:28:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:37,311 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-11-30 01:28:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-30 01:28:37,324 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 32 [2020-11-30 01:28:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:37,325 INFO L225 Difference]: With dead ends: 53 [2020-11-30 01:28:37,325 INFO L226 Difference]: Without dead ends: 43 [2020-11-30 01:28:37,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 66.0s TimeCoverageRelationStatistics Valid=220, Invalid=1260, Unknown=26, NotChecked=474, Total=1980 [2020-11-30 01:28:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-11-30 01:28:37,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2020-11-30 01:28:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-30 01:28:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-11-30 01:28:37,338 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2020-11-30 01:28:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:37,338 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-11-30 01:28:37,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-11-30 01:28:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-11-30 01:28:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 01:28:37,341 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:37,341 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:37,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 01:28:37,544 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:28:37,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:37,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1418019706, now seen corresponding path program 3 times [2020-11-30 01:28:37,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:37,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805201913] [2020-11-30 01:28:37,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:37,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-30 01:28:37,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-11-30 01:28:37,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:28:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:28:38,194 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:28:38,294 INFO L173 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-11-30 01:28:38,295 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:28:38,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 01:28:38,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:28:38 BoogieIcfgContainer [2020-11-30 01:28:38,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:28:38,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:28:38,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:28:38,607 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:28:38,608 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:25:26" (3/4) ... [2020-11-30 01:28:38,611 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:28:38,719 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e9f50d6b-cb5f-48b7-9a2d-d153bcedebdc/bin/uautomizer/witness.graphml [2020-11-30 01:28:38,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:28:38,721 INFO L168 Benchmark]: Toolchain (without parser) took 193430.30 ms. Allocated memory was 58.7 MB in the beginning and 109.1 MB in the end (delta: 50.3 MB). Free memory was 36.4 MB in the beginning and 61.8 MB in the end (delta: -25.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:38,722 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 58.7 MB. Free memory was 41.2 MB in the beginning and 41.1 MB in the end (delta: 42.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:28:38,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.19 ms. Allocated memory is still 58.7 MB. Free memory was 36.2 MB in the beginning and 29.8 MB in the end (delta: 6.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:38,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.22 ms. Allocated memory is still 58.7 MB. Free memory was 29.8 MB in the beginning and 27.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:38,723 INFO L168 Benchmark]: Boogie Preprocessor took 41.39 ms. Allocated memory is still 58.7 MB. Free memory was 27.5 MB in the beginning and 25.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:38,724 INFO L168 Benchmark]: RCFGBuilder took 842.32 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 25.6 MB in the beginning and 51.6 MB in the end (delta: -26.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:38,724 INFO L168 Benchmark]: TraceAbstraction took 191786.02 ms. Allocated memory was 71.3 MB in the beginning and 109.1 MB in the end (delta: 37.7 MB). Free memory was 51.3 MB in the beginning and 66.0 MB in the end (delta: -14.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:38,724 INFO L168 Benchmark]: Witness Printer took 112.89 ms. Allocated memory is still 109.1 MB. Free memory was 66.0 MB in the beginning and 61.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:38,732 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.26 ms. Allocated memory is still 58.7 MB. Free memory was 41.2 MB in the beginning and 41.1 MB in the end (delta: 42.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 587.19 ms. Allocated memory is still 58.7 MB. Free memory was 36.2 MB in the beginning and 29.8 MB in the end (delta: 6.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.22 ms. Allocated memory is still 58.7 MB. Free memory was 29.8 MB in the beginning and 27.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.39 ms. Allocated memory is still 58.7 MB. Free memory was 27.5 MB in the beginning and 25.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 842.32 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 25.6 MB in the beginning and 51.6 MB in the end (delta: -26.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 191786.02 ms. Allocated memory was 71.3 MB in the beginning and 109.1 MB in the end (delta: 37.7 MB). Free memory was 51.3 MB in the beginning and 66.0 MB in the end (delta: -14.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 16.1 GB. * Witness Printer took 112.89 ms. Allocated memory is still 109.1 MB. Free memory was 66.0 MB in the beginning and 61.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L533] mlist *head; VAL [head={0:0}] [L554] int i; [L555] mlist *mylist, *temp; [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [head={0:0}] [L544] COND TRUE head==((void *)0) [L545] l->next = ((void *)0) VAL [head={0:0}] [L550] head = l [L551] return 0; VAL [head={1:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [head={1:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [head={1:0}] [L550] head = l [L551] return 0; VAL [head={2:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [head={2:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [head={2:0}] [L550] head = l [L551] return 0; VAL [head={3:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [head={3:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [head={3:0}] [L550] head = l [L551] return 0; VAL [head={5:0}] [L535] l = head VAL [head={5:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={5:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={5:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={5:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={5:0}] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; VAL [head={5:0}] [L560] temp = search_list(head,2) [L561] temp->key [L14] COND TRUE !(cond) VAL [head={5:0}] [L12] COND FALSE !(0) VAL [head={5:0}] [L12] __assert_fail ("0", "list_search-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [head={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 191.6s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 135.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 130 SDtfs, 732 SDslu, 405 SDs, 0 SdLazy, 1274 SolverSat, 264 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 333 SyntacticMatches, 4 SemanticMatches, 183 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 160.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 51.1s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 446 ConstructedInterpolants, 34 QuantifiedInterpolants, 165985 SizeOfPredicates, 150 NumberOfNonLiveVariables, 1278 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 12/84 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...