./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:32:37,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:32:37,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:32:37,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:32:37,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:32:37,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:32:37,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:32:37,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:32:37,910 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:32:37,911 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:32:37,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:32:37,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:32:37,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:32:37,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:32:37,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:32:37,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:32:37,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:32:37,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:32:37,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:32:37,918 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:32:37,919 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:32:37,919 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:32:37,920 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:32:37,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:32:37,920 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:32:37,921 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:32:37,921 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:32:37,922 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:32:37,922 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:32:37,923 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:32:37,923 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:32:37,924 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:32:37,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:32:37,924 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:32:37,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:32:37,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:32:37,925 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 00:32:37,932 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:32:37,933 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:32:37,933 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:32:37,933 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:32:37,934 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:32:37,934 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:32:37,934 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:32:37,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:32:37,934 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:32:37,935 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:32:37,935 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:32:37,935 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:32:37,935 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:32:37,935 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 00:32:37,935 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 00:32:37,935 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 00:32:37,936 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:32:37,936 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:32:37,936 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:32:37,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:32:37,936 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:32:37,936 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:32:37,936 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:32:37,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:32:37,937 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:32:37,937 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:32:37,937 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:32:37,937 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:32:37,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-23 00:32:37,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:32:37,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:32:37,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:32:37,973 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:32:37,974 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:32:37,974 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 00:32:38,016 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/data/f0db90f0e/e0734702b4284692b678e57a1e8b7a68/FLAGacb545e06 [2018-11-23 00:32:38,368 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:32:38,368 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 00:32:38,376 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/data/f0db90f0e/e0734702b4284692b678e57a1e8b7a68/FLAGacb545e06 [2018-11-23 00:32:38,387 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/data/f0db90f0e/e0734702b4284692b678e57a1e8b7a68 [2018-11-23 00:32:38,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:32:38,390 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 00:32:38,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:32:38,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:32:38,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:32:38,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:32:38" (1/1) ... [2018-11-23 00:32:38,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e1a27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38, skipping insertion in model container [2018-11-23 00:32:38,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:32:38" (1/1) ... [2018-11-23 00:32:38,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:32:38,430 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:32:38,623 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:32:38,630 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:32:38,702 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:32:38,725 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:32:38,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38 WrapperNode [2018-11-23 00:32:38,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:32:38,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:32:38,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:32:38,726 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:32:38,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 00:32:38,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 00:32:38,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 00:32:38,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 00:32:38,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 00:32:38,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 00:32:38,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 00:32:38,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:32:38,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:32:38,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:32:38,774 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:32:38,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/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 [2018-11-23 00:32:38,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:32:38,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:32:38,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:32:38,809 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-23 00:32:38,809 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-23 00:32:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-23 00:32:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-23 00:32:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-23 00:32:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-23 00:32:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-23 00:32:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-23 00:32:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-23 00:32:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-23 00:32:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-23 00:32:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-23 00:32:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-23 00:32:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-23 00:32:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-23 00:32:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-23 00:32:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-23 00:32:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-23 00:32:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-23 00:32:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-23 00:32:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-23 00:32:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-23 00:32:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-23 00:32:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-23 00:32:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-23 00:32:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-23 00:32:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-23 00:32:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-23 00:32:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-23 00:32:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-23 00:32:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-23 00:32:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-23 00:32:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-23 00:32:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-23 00:32:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-23 00:32:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-23 00:32:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-23 00:32:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-23 00:32:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 00:32:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-23 00:32:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-23 00:32:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-23 00:32:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-23 00:32:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-23 00:32:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-23 00:32:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-23 00:32:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-23 00:32:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-23 00:32:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-23 00:32:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-23 00:32:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-23 00:32:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-23 00:32:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-23 00:32:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-23 00:32:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-23 00:32:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-23 00:32:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-23 00:32:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-23 00:32:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-23 00:32:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-23 00:32:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-23 00:32:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-23 00:32:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-23 00:32:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-23 00:32:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-23 00:32:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-23 00:32:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-23 00:32:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-23 00:32:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-23 00:32:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-23 00:32:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-23 00:32:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-23 00:32:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-23 00:32:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-23 00:32:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-23 00:32:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-23 00:32:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-23 00:32:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-23 00:32:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-23 00:32:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-23 00:32:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:32:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:32:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 00:32:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:32:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 00:32:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:32:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:32:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:32:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:32:39,282 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:32:39,282 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-23 00:32:39,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:32:39 BoogieIcfgContainer [2018-11-23 00:32:39,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:32:39,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:32:39,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:32:39,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:32:39,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:32:38" (1/3) ... [2018-11-23 00:32:39,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dacdcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:32:39, skipping insertion in model container [2018-11-23 00:32:39,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (2/3) ... [2018-11-23 00:32:39,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dacdcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:32:39, skipping insertion in model container [2018-11-23 00:32:39,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:32:39" (3/3) ... [2018-11-23 00:32:39,287 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 00:32:39,293 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:32:39,299 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-11-23 00:32:39,313 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-11-23 00:32:39,332 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:32:39,333 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:32:39,333 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 00:32:39,333 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:32:39,333 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:32:39,333 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:32:39,333 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:32:39,333 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:32:39,333 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:32:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-11-23 00:32:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 00:32:39,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:39,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:39,352 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:39,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:39,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008576, now seen corresponding path program 1 times [2018-11-23 00:32:39,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:39,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:39,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:39,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:39,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:39,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:39,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:32:39,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:32:39,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:32:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:39,469 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2018-11-23 00:32:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:39,657 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2018-11-23 00:32:39,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:32:39,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 00:32:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:39,664 INFO L225 Difference]: With dead ends: 171 [2018-11-23 00:32:39,665 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 00:32:39,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 00:32:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2018-11-23 00:32:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 00:32:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2018-11-23 00:32:39,698 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 7 [2018-11-23 00:32:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:39,698 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2018-11-23 00:32:39,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:32:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2018-11-23 00:32:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 00:32:39,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:39,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:39,699 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:39,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008577, now seen corresponding path program 1 times [2018-11-23 00:32:39,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:39,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:39,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:39,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:39,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:32:39,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:32:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:32:39,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:39,756 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand 3 states. [2018-11-23 00:32:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:39,834 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2018-11-23 00:32:39,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:32:39,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 00:32:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:39,835 INFO L225 Difference]: With dead ends: 140 [2018-11-23 00:32:39,835 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 00:32:39,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 00:32:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-11-23 00:32:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 00:32:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 145 transitions. [2018-11-23 00:32:39,841 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 145 transitions. Word has length 7 [2018-11-23 00:32:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:39,841 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 145 transitions. [2018-11-23 00:32:39,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:32:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2018-11-23 00:32:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:32:39,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:39,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:39,842 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:39,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:39,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1110148732, now seen corresponding path program 1 times [2018-11-23 00:32:39,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:39,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:39,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:39,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:39,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:39,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:39,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:32:39,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:32:39,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:32:39,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:39,876 INFO L87 Difference]: Start difference. First operand 140 states and 145 transitions. Second operand 3 states. [2018-11-23 00:32:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:39,964 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-11-23 00:32:39,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:32:39,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 00:32:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:39,965 INFO L225 Difference]: With dead ends: 139 [2018-11-23 00:32:39,965 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 00:32:39,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 00:32:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-11-23 00:32:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 00:32:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-11-23 00:32:39,973 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 11 [2018-11-23 00:32:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:39,973 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-11-23 00:32:39,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:32:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-11-23 00:32:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:32:39,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:39,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:39,974 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:39,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:39,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1110148731, now seen corresponding path program 1 times [2018-11-23 00:32:39,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:39,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:39,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:39,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:39,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:40,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:40,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:32:40,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:32:40,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:32:40,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:40,012 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 3 states. [2018-11-23 00:32:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:40,080 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2018-11-23 00:32:40,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:32:40,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 00:32:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:40,081 INFO L225 Difference]: With dead ends: 148 [2018-11-23 00:32:40,081 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 00:32:40,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 00:32:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2018-11-23 00:32:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 00:32:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-11-23 00:32:40,086 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 11 [2018-11-23 00:32:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:40,086 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-11-23 00:32:40,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:32:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-11-23 00:32:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 00:32:40,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:40,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:40,088 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:40,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash 252296525, now seen corresponding path program 1 times [2018-11-23 00:32:40,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:40,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:40,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:40,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:40,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:40,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:40,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:32:40,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:32:40,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:32:40,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:32:40,134 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 4 states. [2018-11-23 00:32:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:40,271 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-23 00:32:40,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:32:40,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 00:32:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:40,271 INFO L225 Difference]: With dead ends: 140 [2018-11-23 00:32:40,271 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 00:32:40,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:40,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 00:32:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2018-11-23 00:32:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 00:32:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-11-23 00:32:40,276 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 17 [2018-11-23 00:32:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:40,276 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-11-23 00:32:40,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:32:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-11-23 00:32:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 00:32:40,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:40,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:40,277 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:40,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:40,277 INFO L82 PathProgramCache]: Analyzing trace with hash 252296526, now seen corresponding path program 1 times [2018-11-23 00:32:40,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:40,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:40,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:40,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:40,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:40,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:40,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:32:40,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 00:32:40,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:32:40,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:32:40,348 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 6 states. [2018-11-23 00:32:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:40,565 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2018-11-23 00:32:40,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:32:40,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 00:32:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:40,566 INFO L225 Difference]: With dead ends: 160 [2018-11-23 00:32:40,566 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 00:32:40,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:32:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 00:32:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2018-11-23 00:32:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 00:32:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-11-23 00:32:40,569 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 17 [2018-11-23 00:32:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:40,570 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-11-23 00:32:40,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 00:32:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-11-23 00:32:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 00:32:40,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:40,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:40,575 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:40,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:40,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1938792144, now seen corresponding path program 1 times [2018-11-23 00:32:40,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:40,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:40,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:40,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:40,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:40,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:40,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:32:40,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:32:40,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:32:40,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:40,638 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 5 states. [2018-11-23 00:32:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:40,769 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-11-23 00:32:40,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:32:40,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 00:32:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:40,771 INFO L225 Difference]: With dead ends: 177 [2018-11-23 00:32:40,771 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 00:32:40,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:32:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 00:32:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2018-11-23 00:32:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 00:32:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-11-23 00:32:40,775 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 19 [2018-11-23 00:32:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:40,776 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-11-23 00:32:40,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:32:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-11-23 00:32:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 00:32:40,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:40,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:40,777 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:40,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:40,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1938792145, now seen corresponding path program 1 times [2018-11-23 00:32:40,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:40,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:40,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:40,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:40,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:40,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:40,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:32:40,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:32:40,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:32:40,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:40,828 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 5 states. [2018-11-23 00:32:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:41,024 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-11-23 00:32:41,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:32:41,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 00:32:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:41,025 INFO L225 Difference]: With dead ends: 198 [2018-11-23 00:32:41,025 INFO L226 Difference]: Without dead ends: 198 [2018-11-23 00:32:41,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:32:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-23 00:32:41,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 133. [2018-11-23 00:32:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 00:32:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-11-23 00:32:41,029 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 19 [2018-11-23 00:32:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:41,030 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-11-23 00:32:41,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:32:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2018-11-23 00:32:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 00:32:41,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:41,030 INFO L402 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] [2018-11-23 00:32:41,031 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:41,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash -771138030, now seen corresponding path program 1 times [2018-11-23 00:32:41,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:41,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:41,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:41,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:41,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 00:32:41,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 00:32:41,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 00:32:41,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:32:41,115 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 9 states. [2018-11-23 00:32:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:41,383 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-11-23 00:32:41,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:32:41,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 00:32:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:41,384 INFO L225 Difference]: With dead ends: 145 [2018-11-23 00:32:41,384 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 00:32:41,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:32:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 00:32:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2018-11-23 00:32:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 00:32:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-11-23 00:32:41,388 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 23 [2018-11-23 00:32:41,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:41,388 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-11-23 00:32:41,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 00:32:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-11-23 00:32:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 00:32:41,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:41,388 INFO L402 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] [2018-11-23 00:32:41,388 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:41,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:41,389 INFO L82 PathProgramCache]: Analyzing trace with hash -771138029, now seen corresponding path program 1 times [2018-11-23 00:32:41,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:41,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:41,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:41,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:41,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:41,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 00:32:41,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 00:32:41,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 00:32:41,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:32:41,518 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 10 states. [2018-11-23 00:32:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:41,989 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-11-23 00:32:41,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 00:32:41,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 00:32:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:41,990 INFO L225 Difference]: With dead ends: 156 [2018-11-23 00:32:41,990 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 00:32:41,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-11-23 00:32:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 00:32:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2018-11-23 00:32:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 00:32:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-11-23 00:32:41,993 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 23 [2018-11-23 00:32:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:41,994 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-11-23 00:32:41,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 00:32:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-11-23 00:32:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 00:32:41,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:41,994 INFO L402 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, 1, 1, 1] [2018-11-23 00:32:41,995 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:41,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:41,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1856557850, now seen corresponding path program 1 times [2018-11-23 00:32:41,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:41,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:41,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:41,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:41,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:42,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:42,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 00:32:42,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 00:32:42,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:32:42,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:32:42,029 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 6 states. [2018-11-23 00:32:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:42,149 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-11-23 00:32:42,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:32:42,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-23 00:32:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:42,150 INFO L225 Difference]: With dead ends: 159 [2018-11-23 00:32:42,150 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 00:32:42,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:32:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 00:32:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2018-11-23 00:32:42,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 00:32:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-11-23 00:32:42,153 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 26 [2018-11-23 00:32:42,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:42,153 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-11-23 00:32:42,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 00:32:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-11-23 00:32:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 00:32:42,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:42,156 INFO L402 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, 1, 1, 1] [2018-11-23 00:32:42,157 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:42,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1909518208, now seen corresponding path program 1 times [2018-11-23 00:32:42,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:42,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:42,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:42,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:42,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:42,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:32:42,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:32:42,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:42,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:42,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:32:42,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-11-23 00:32:42,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 00:32:42,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:42,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 00:32:42,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 00:32:42,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:42,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 00:32:42,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-11-23 00:32:42,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 00:32:42,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:42,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:42,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:42,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-23 00:32:42,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-11-23 00:32:42,452 INFO L478 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 36 treesize of output 26 [2018-11-23 00:32:42,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-11-23 00:32:42,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:42,463 INFO L267 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. [2018-11-23 00:32:42,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:15 [2018-11-23 00:32:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:42,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:32:42,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 15 [2018-11-23 00:32:42,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 00:32:42,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 00:32:42,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-23 00:32:42,524 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 15 states. [2018-11-23 00:32:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:43,336 INFO L93 Difference]: Finished difference Result 201 states and 214 transitions. [2018-11-23 00:32:43,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 00:32:43,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-23 00:32:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:43,339 INFO L225 Difference]: With dead ends: 201 [2018-11-23 00:32:43,339 INFO L226 Difference]: Without dead ends: 201 [2018-11-23 00:32:43,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2018-11-23 00:32:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-23 00:32:43,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 148. [2018-11-23 00:32:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-23 00:32:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-11-23 00:32:43,343 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 29 [2018-11-23 00:32:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:43,344 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-11-23 00:32:43,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 00:32:43,344 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-11-23 00:32:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 00:32:43,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:43,345 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:43,345 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:43,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:43,349 INFO L82 PathProgramCache]: Analyzing trace with hash -778956281, now seen corresponding path program 1 times [2018-11-23 00:32:43,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:43,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:43,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:43,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:43,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:43,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:43,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:32:43,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:32:43,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:32:43,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:43,402 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 5 states. [2018-11-23 00:32:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:43,550 INFO L93 Difference]: Finished difference Result 212 states and 229 transitions. [2018-11-23 00:32:43,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:32:43,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 00:32:43,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:43,551 INFO L225 Difference]: With dead ends: 212 [2018-11-23 00:32:43,551 INFO L226 Difference]: Without dead ends: 212 [2018-11-23 00:32:43,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:32:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-23 00:32:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 147. [2018-11-23 00:32:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 00:32:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2018-11-23 00:32:43,555 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 30 [2018-11-23 00:32:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:43,556 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2018-11-23 00:32:43,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:32:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2018-11-23 00:32:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 00:32:43,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:43,556 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:43,557 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:43,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:43,557 INFO L82 PathProgramCache]: Analyzing trace with hash -778956280, now seen corresponding path program 1 times [2018-11-23 00:32:43,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:43,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:43,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:43,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:43,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:43,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:43,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:32:43,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:32:43,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:32:43,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:43,623 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 5 states. [2018-11-23 00:32:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:43,795 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-11-23 00:32:43,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:32:43,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 00:32:43,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:43,796 INFO L225 Difference]: With dead ends: 233 [2018-11-23 00:32:43,796 INFO L226 Difference]: Without dead ends: 233 [2018-11-23 00:32:43,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:32:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-23 00:32:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 146. [2018-11-23 00:32:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 00:32:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-11-23 00:32:43,800 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 30 [2018-11-23 00:32:43,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:43,800 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-11-23 00:32:43,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:32:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-11-23 00:32:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 00:32:43,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:43,801 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:43,805 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:43,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2118711400, now seen corresponding path program 1 times [2018-11-23 00:32:43,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:43,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:43,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:43,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:43,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:43,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:32:43,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:32:43,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:32:43,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:43,892 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 5 states. [2018-11-23 00:32:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:43,980 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-11-23 00:32:43,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:32:43,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 00:32:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:43,980 INFO L225 Difference]: With dead ends: 149 [2018-11-23 00:32:43,980 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 00:32:43,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:32:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 00:32:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-11-23 00:32:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 00:32:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-11-23 00:32:43,984 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 30 [2018-11-23 00:32:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:43,984 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-11-23 00:32:43,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:32:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-11-23 00:32:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 00:32:43,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:43,985 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:43,985 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:43,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:43,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1095967582, now seen corresponding path program 1 times [2018-11-23 00:32:43,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:43,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:43,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 00:32:44,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:44,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 00:32:44,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 00:32:44,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:32:44,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:32:44,036 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 6 states. [2018-11-23 00:32:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:44,137 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2018-11-23 00:32:44,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:32:44,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 00:32:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:44,138 INFO L225 Difference]: With dead ends: 158 [2018-11-23 00:32:44,138 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 00:32:44,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:32:44,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 00:32:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2018-11-23 00:32:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 00:32:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-11-23 00:32:44,141 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 31 [2018-11-23 00:32:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:44,141 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-11-23 00:32:44,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 00:32:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-11-23 00:32:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 00:32:44,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:44,142 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:44,142 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:44,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1230015159, now seen corresponding path program 1 times [2018-11-23 00:32:44,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:44,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:44,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:44,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:44,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 00:32:44,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 00:32:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:32:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:32:44,256 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 12 states. [2018-11-23 00:32:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:44,578 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-11-23 00:32:44,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 00:32:44,579 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-23 00:32:44,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:44,579 INFO L225 Difference]: With dead ends: 144 [2018-11-23 00:32:44,579 INFO L226 Difference]: Without dead ends: 144 [2018-11-23 00:32:44,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-11-23 00:32:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-23 00:32:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-11-23 00:32:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 00:32:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-11-23 00:32:44,582 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 34 [2018-11-23 00:32:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:44,582 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-11-23 00:32:44,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 00:32:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-11-23 00:32:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 00:32:44,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:44,583 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:44,583 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:44,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:44,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1230015158, now seen corresponding path program 1 times [2018-11-23 00:32:44,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:44,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:44,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:44,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:44,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:44,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:44,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 00:32:44,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 00:32:44,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 00:32:44,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:32:44,675 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 9 states. [2018-11-23 00:32:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:44,931 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-23 00:32:44,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:32:44,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-23 00:32:44,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:44,932 INFO L225 Difference]: With dead ends: 140 [2018-11-23 00:32:44,932 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 00:32:44,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:32:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 00:32:44,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2018-11-23 00:32:44,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 00:32:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-11-23 00:32:44,934 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 34 [2018-11-23 00:32:44,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:44,935 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-11-23 00:32:44,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 00:32:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 00:32:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 00:32:44,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:44,935 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:44,936 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:44,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:44,936 INFO L82 PathProgramCache]: Analyzing trace with hash 701473530, now seen corresponding path program 1 times [2018-11-23 00:32:44,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:44,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:44,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:44,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:32:44,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:32:45,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:45,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:45,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 00:32:45,023 INFO L478 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 10 treesize of output 9 [2018-11-23 00:32:45,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:45,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:45,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:45,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-23 00:32:45,027 INFO L478 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 19 treesize of output 15 [2018-11-23 00:32:45,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 00:32:45,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:45,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:45,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:45,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-23 00:32:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 00:32:45,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:32:45,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-11-23 00:32:45,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 00:32:45,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 00:32:45,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:32:45,053 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 9 states. [2018-11-23 00:32:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:45,240 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2018-11-23 00:32:45,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:32:45,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 00:32:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:45,242 INFO L225 Difference]: With dead ends: 143 [2018-11-23 00:32:45,242 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 00:32:45,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 00:32:45,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 00:32:45,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 119. [2018-11-23 00:32:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 00:32:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-11-23 00:32:45,245 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 36 [2018-11-23 00:32:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:45,245 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-11-23 00:32:45,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 00:32:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-23 00:32:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 00:32:45,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:45,247 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:45,248 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:45,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:45,248 INFO L82 PathProgramCache]: Analyzing trace with hash -401458596, now seen corresponding path program 1 times [2018-11-23 00:32:45,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:45,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:45,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:45,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:45,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:45,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:32:45,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:32:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:45,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:45,463 INFO L478 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 11 [2018-11-23 00:32:45,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:32:45,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:45,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:45,473 INFO L478 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 11 [2018-11-23 00:32:45,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:32:45,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:45,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:45,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:45,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-11-23 00:32:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:45,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:32:45,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-23 00:32:45,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 00:32:45,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 00:32:45,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:32:45,530 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 14 states. [2018-11-23 00:32:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:45,904 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-11-23 00:32:45,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 00:32:45,904 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-23 00:32:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:45,905 INFO L225 Difference]: With dead ends: 148 [2018-11-23 00:32:45,905 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 00:32:45,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-11-23 00:32:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 00:32:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2018-11-23 00:32:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 00:32:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-11-23 00:32:45,907 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 37 [2018-11-23 00:32:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:45,908 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-11-23 00:32:45,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 00:32:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-11-23 00:32:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 00:32:45,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:45,908 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:45,909 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2018-11-23 00:32:45,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash 439684856, now seen corresponding path program 1 times [2018-11-23 00:32:45,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:45,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:45,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:45,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:45,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:32:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:32:45,939 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=22, |#NULL.offset|=13, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=13] [?] RET #286#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret21 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); srcloc: L988 VAL [main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4); srcloc: L988-1 VAL [main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4); srcloc: L989 VAL [main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); srcloc: L993 VAL [main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 VAL [main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L994 VAL [main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] goto; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1031-3 VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~mem12|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem12);havoc #t~mem12; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] goto; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1034 VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~mem13|=1] [?] assume !(~unnamed1~0~RED == #t~mem13);havoc #t~mem13; VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1034-2 VAL [main_~end~0.base=19, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~mem16.base|=20, |main_#t~mem16.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call #t~mem17 := read~int(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L1047 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~mem17|=1] [?] assume !(~unnamed1~0~RED == #t~mem17);havoc #t~mem17; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4); srcloc: L1056 VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0, |main_#t~mem20.base|=20, |main_#t~mem20.offset|=0] [?] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset;havoc #t~mem20.base, #t~mem20.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume 0 == ~list~0.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=19, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume 0 == ~list~0.base || 1 == #valid[~list~0.base];call ULTIMATE.dealloc(~list~0.base, ~list~0.offset);~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] #res := 0; VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#res|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] assume !(#valid == old(#valid)); VAL [main_~end~0.base=20, main_~end~0.offset=0, main_~list~0.base=20, main_~list~0.offset=0, main_~null~0.base=20, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#res|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=19, |main_#t~malloc1.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=13, old(#NULL.base)=22, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L988] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L989] call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L990] call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L995] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~nondet2=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1000-L1024] assume !(0 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1031] call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem12=1, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem13=1, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem16.base=20, #t~mem16.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1032-L1042] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1045-L1060] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1047] call #t~mem17 := read~int(~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem17=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1047-L1059] assume !(~unnamed1~0~RED == #t~mem17); [L1047] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1056] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem20.base=20, #t~mem20.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1056] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset; [L1056] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1057] assert 0 == ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1057] assert 0 == ~list~0.base || 1 == #valid[~list~0.base]; [L1057] call ULTIMATE.dealloc(~list~0.base, ~list~0.offset); [L1058] ~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1045-L1060] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1062] #res := 0; VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L985-L1063] ensures #valid == old(#valid); VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] ----- [2018-11-23 00:32:45,976 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=13, old(#NULL.base)=22, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L988] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L989] call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L990] call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L995] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~nondet2=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1000-L1024] assume !(0 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1031] call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem12=1, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem13=1, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem16.base=20, #t~mem16.offset=0, ~end~0.base=19, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1032-L1042] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1045-L1060] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1047] call #t~mem17 := read~int(~list~0.base, 8 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem17=1, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1047-L1059] assume !(~unnamed1~0~RED == #t~mem17); [L1047] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1056] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, #t~mem20.base=20, #t~mem20.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1056] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset; [L1056] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1057] assert 0 == ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=19, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1057] assert 0 == ~list~0.base || 1 == #valid[~list~0.base]; [L1057] call ULTIMATE.dealloc(~list~0.base, ~list~0.offset); [L1058] ~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1045-L1060] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L1062] #res := 0; VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [L985-L1063] ensures #valid == old(#valid); VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~malloc1.base=19, #t~malloc1.offset=0, ~end~0.base=20, ~end~0.offset=0, ~list~0.base=20, ~list~0.offset=0, ~null~0.base=20, ~null~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=13, old(#NULL!base)=22, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~nondet2=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem12=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem13=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem16!base=20, #t~mem16!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] FCALL call #t~mem17 := read~int({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem17=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem20!base=20, #t~mem20!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!base || 1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1062] #res := 0; VAL [#NULL!base=0, #NULL!offset=0, #res=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=13, old(#NULL!base)=22, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~nondet2=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem12=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem13=1, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem16!base=20, #t~mem16!offset=0, ~end~0!base=19, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] FCALL call #t~mem17 := read~int({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem17=1, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, #t~mem20!base=20, #t~mem20!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=19, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1057] assert 0 == ~list~0!base || 1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L1062] #res := 0; VAL [#NULL!base=0, #NULL!offset=0, #res=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~malloc1!base=19, #t~malloc1!offset=0, ~end~0!base=20, ~end~0!offset=0, ~list~0!base=20, ~list~0!offset=0, ~null~0!base=20, ~null~0!offset=0] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L993] list->next = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L994] list->prev = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L995] list->colour = BLACK VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L997] struct TSLL* end = list; VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1031] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1034] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={19:0}, end->next={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1045] COND TRUE null != list VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1047] EXPR list->colour VAL [end={20:0}, list={19:0}, list->colour=1, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={20:0}, list={19:0}, list->next={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1056] end = list->next [L1057] free(list) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1057] free(list) [L1058] list = end VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1045] COND FALSE !(null != list) VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1062] return 0; VAL [\result=0, end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] ----- [2018-11-23 00:32:46,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:32:46 BoogieIcfgContainer [2018-11-23 00:32:46,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:32:46,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:32:46,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:32:46,011 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:32:46,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:32:39" (3/4) ... [2018-11-23 00:32:46,018 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:32:46,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:32:46,018 INFO L168 Benchmark]: Toolchain (without parser) took 7628.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 955.5 MB in the beginning and 1.2 GB in the end (delta: -204.1 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:32:46,020 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:32:46,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:32:46,020 INFO L168 Benchmark]: Boogie Preprocessor took 47.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:32:46,021 INFO L168 Benchmark]: RCFGBuilder took 508.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:32:46,021 INFO L168 Benchmark]: TraceAbstraction took 6727.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:32:46,030 INFO L168 Benchmark]: Witness Printer took 6.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:32:46,032 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 508.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6727.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 6.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L993] list->next = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L994] list->prev = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L995] list->colour = BLACK VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L997] struct TSLL* end = list; VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1031] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1034] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={19:0}, end->next={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1045] COND TRUE null != list VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1047] EXPR list->colour VAL [end={20:0}, list={19:0}, list->colour=1, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={20:0}, list={19:0}, list->next={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1056] end = list->next [L1057] free(list) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1057] free(list) [L1058] list = end VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1045] COND FALSE !(null != list) VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1062] return 0; VAL [\result=0, end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 67 error locations. UNSAFE Result, 6.6s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1675 SDtfs, 3225 SDslu, 3503 SDs, 0 SdLazy, 5632 SolverSat, 309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 111 SyntacticMatches, 13 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 527 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 611 NumberOfCodeBlocks, 611 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 550 ConstructedInterpolants, 3 QuantifiedInterpolants, 107179 SizeOfPredicates, 27 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 5/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 00:32:47,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:32:47,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:32:47,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:32:47,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:32:47,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:32:47,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:32:47,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:32:47,517 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:32:47,518 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:32:47,519 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:32:47,519 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:32:47,519 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:32:47,520 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:32:47,521 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:32:47,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:32:47,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:32:47,523 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:32:47,525 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:32:47,526 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:32:47,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:32:47,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:32:47,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:32:47,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:32:47,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:32:47,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:32:47,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:32:47,531 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:32:47,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:32:47,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:32:47,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:32:47,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:32:47,533 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:32:47,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:32:47,534 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:32:47,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:32:47,534 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-11-23 00:32:47,545 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:32:47,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:32:47,546 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:32:47,546 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:32:47,546 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:32:47,546 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:32:47,546 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:32:47,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:32:47,547 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:32:47,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:32:47,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:32:47,547 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:32:47,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:32:47,547 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 00:32:47,548 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 00:32:47,548 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 00:32:47,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:32:47,548 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 00:32:47,548 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 00:32:47,548 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:32:47,548 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:32:47,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:32:47,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:32:47,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:32:47,549 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:32:47,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:32:47,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:32:47,549 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:32:47,550 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 00:32:47,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:32:47,550 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 00:32:47,550 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-23 00:32:47,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:32:47,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:32:47,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:32:47,594 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:32:47,594 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:32:47,595 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 00:32:47,634 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/data/3a81f0b44/616e24887826497cb61ffa121f60359a/FLAGbf99cc971 [2018-11-23 00:32:47,976 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:32:47,976 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 00:32:47,985 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/data/3a81f0b44/616e24887826497cb61ffa121f60359a/FLAGbf99cc971 [2018-11-23 00:32:47,995 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/data/3a81f0b44/616e24887826497cb61ffa121f60359a [2018-11-23 00:32:47,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:32:47,999 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 00:32:47,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:32:48,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:32:48,003 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:32:48,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:32:47" (1/1) ... [2018-11-23 00:32:48,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee470f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:48, skipping insertion in model container [2018-11-23 00:32:48,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:32:47" (1/1) ... [2018-11-23 00:32:48,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:32:48,046 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:32:48,265 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:32:48,273 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:32:48,305 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:32:48,389 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:32:48,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:48 WrapperNode [2018-11-23 00:32:48,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:32:48,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:32:48,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:32:48,390 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:32:48,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:48" (1/1) ... [2018-11-23 00:32:48,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:48" (1/1) ... [2018-11-23 00:32:48,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:48" (1/1) ... [2018-11-23 00:32:48,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:48" (1/1) ... [2018-11-23 00:32:48,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:48" (1/1) ... [2018-11-23 00:32:48,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:48" (1/1) ... [2018-11-23 00:32:48,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:48" (1/1) ... [2018-11-23 00:32:48,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:32:48,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:32:48,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:32:48,439 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:32:48,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/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 [2018-11-23 00:32:48,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:32:48,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:32:48,470 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:32:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-23 00:32:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-23 00:32:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-23 00:32:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-23 00:32:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-23 00:32:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-23 00:32:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-23 00:32:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-23 00:32:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-23 00:32:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-23 00:32:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-23 00:32:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-23 00:32:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-23 00:32:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-23 00:32:48,472 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-23 00:32:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-23 00:32:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-23 00:32:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-23 00:32:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-23 00:32:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-23 00:32:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-23 00:32:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-23 00:32:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-23 00:32:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-23 00:32:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-23 00:32:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-23 00:32:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-23 00:32:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-23 00:32:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-23 00:32:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-23 00:32:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-23 00:32:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-23 00:32:48,475 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-23 00:32:48,475 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-23 00:32:48,475 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-23 00:32:48,475 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-23 00:32:48,475 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-23 00:32:48,475 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-23 00:32:48,475 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-23 00:32:48,475 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-23 00:32:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-23 00:32:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-23 00:32:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-23 00:32:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-23 00:32:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-23 00:32:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-23 00:32:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-23 00:32:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-23 00:32:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-23 00:32:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-23 00:32:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-23 00:32:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-23 00:32:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-23 00:32:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-23 00:32:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-23 00:32:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-23 00:32:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-23 00:32:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-23 00:32:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-23 00:32:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-23 00:32:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-23 00:32:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-23 00:32:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-23 00:32:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 00:32:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-23 00:32:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-23 00:32:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-23 00:32:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-23 00:32:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-23 00:32:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-23 00:32:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-23 00:32:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-23 00:32:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-23 00:32:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-23 00:32:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-23 00:32:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-23 00:32:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-23 00:32:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-23 00:32:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-23 00:32:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-23 00:32:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-23 00:32:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-23 00:32:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-23 00:32:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-23 00:32:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-23 00:32:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-23 00:32:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-23 00:32:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-23 00:32:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-23 00:32:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-23 00:32:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-23 00:32:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-23 00:32:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-23 00:32:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-23 00:32:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-23 00:32:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-23 00:32:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-23 00:32:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-23 00:32:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-23 00:32:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-23 00:32:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-23 00:32:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-23 00:32:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-23 00:32:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-23 00:32:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-23 00:32:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:32:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:32:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 00:32:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 00:32:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 00:32:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 00:32:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:32:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:32:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:32:49,109 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:32:49,109 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-23 00:32:49,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:32:49 BoogieIcfgContainer [2018-11-23 00:32:49,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:32:49,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:32:49,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:32:49,112 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:32:49,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:32:47" (1/3) ... [2018-11-23 00:32:49,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31417174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:32:49, skipping insertion in model container [2018-11-23 00:32:49,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:48" (2/3) ... [2018-11-23 00:32:49,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31417174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:32:49, skipping insertion in model container [2018-11-23 00:32:49,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:32:49" (3/3) ... [2018-11-23 00:32:49,114 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 00:32:49,120 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:32:49,126 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-11-23 00:32:49,136 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-11-23 00:32:49,153 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:32:49,153 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:32:49,154 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 00:32:49,154 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:32:49,154 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:32:49,154 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:32:49,154 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:32:49,154 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:32:49,154 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:32:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-11-23 00:32:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 00:32:49,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:49,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:49,176 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:49,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:49,180 INFO L82 PathProgramCache]: Analyzing trace with hash -487060290, now seen corresponding path program 1 times [2018-11-23 00:32:49,182 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:49,182 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:49,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:49,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:49,257 INFO L478 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 [2018-11-23 00:32:49,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:49,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:49,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 00:32:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:49,274 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:49,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:49,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:32:49,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:32:49,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:32:49,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:49,295 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2018-11-23 00:32:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:49,603 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2018-11-23 00:32:49,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:32:49,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 00:32:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:49,610 INFO L225 Difference]: With dead ends: 169 [2018-11-23 00:32:49,610 INFO L226 Difference]: Without dead ends: 165 [2018-11-23 00:32:49,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-23 00:32:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2018-11-23 00:32:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 00:32:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-11-23 00:32:49,637 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 7 [2018-11-23 00:32:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:49,637 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-11-23 00:32:49,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:32:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-11-23 00:32:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 00:32:49,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:49,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:49,638 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:49,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:49,639 INFO L82 PathProgramCache]: Analyzing trace with hash -487060289, now seen corresponding path program 1 times [2018-11-23 00:32:49,639 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:49,639 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:49,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:49,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:49,672 INFO L478 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 [2018-11-23 00:32:49,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:49,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:49,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 00:32:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:49,686 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:49,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:49,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:32:49,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:32:49,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:32:49,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:49,689 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 3 states. [2018-11-23 00:32:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:49,945 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-11-23 00:32:49,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:32:49,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 00:32:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:49,947 INFO L225 Difference]: With dead ends: 138 [2018-11-23 00:32:49,947 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 00:32:49,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 00:32:49,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-23 00:32:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 00:32:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-11-23 00:32:49,955 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 7 [2018-11-23 00:32:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:49,955 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-11-23 00:32:49,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:32:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-11-23 00:32:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:32:49,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:49,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:49,956 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:49,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:49,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1518093250, now seen corresponding path program 1 times [2018-11-23 00:32:49,957 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:49,957 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:49,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:50,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:50,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:32:50,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:50,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:32:50,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-23 00:32:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:50,034 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:50,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:50,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:32:50,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:32:50,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:32:50,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:32:50,039 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 4 states. [2018-11-23 00:32:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:50,268 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-11-23 00:32:50,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:32:50,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 00:32:50,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:50,269 INFO L225 Difference]: With dead ends: 137 [2018-11-23 00:32:50,269 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 00:32:50,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:32:50,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 00:32:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-11-23 00:32:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 00:32:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-11-23 00:32:50,276 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 11 [2018-11-23 00:32:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:50,276 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-11-23 00:32:50,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:32:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-11-23 00:32:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:32:50,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:50,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:50,277 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:50,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:50,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1518093251, now seen corresponding path program 1 times [2018-11-23 00:32:50,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:50,278 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:50,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:50,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:50,328 INFO L478 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 [2018-11-23 00:32:50,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:50,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:50,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 00:32:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:50,348 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:50,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:50,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:32:50,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:32:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:32:50,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:50,350 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 3 states. [2018-11-23 00:32:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:50,583 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-11-23 00:32:50,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:32:50,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 00:32:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:50,584 INFO L225 Difference]: With dead ends: 146 [2018-11-23 00:32:50,584 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 00:32:50,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 00:32:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2018-11-23 00:32:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 00:32:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-11-23 00:32:50,591 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 11 [2018-11-23 00:32:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:50,591 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-11-23 00:32:50,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:32:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-11-23 00:32:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 00:32:50,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:50,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:50,592 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:50,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1912036980, now seen corresponding path program 1 times [2018-11-23 00:32:50,593 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:50,593 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:50,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:50,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:50,660 INFO L478 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 [2018-11-23 00:32:50,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:50,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:50,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 00:32:50,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:50,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:50,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 00:32:50,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:50,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:32:50,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-11-23 00:32:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:50,705 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:50,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:50,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:32:50,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:32:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:32:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:50,710 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 5 states. [2018-11-23 00:32:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:51,094 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 00:32:51,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:32:51,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 00:32:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:51,095 INFO L225 Difference]: With dead ends: 138 [2018-11-23 00:32:51,095 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 00:32:51,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:32:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 00:32:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-11-23 00:32:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 00:32:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-11-23 00:32:51,100 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 16 [2018-11-23 00:32:51,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:51,100 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-11-23 00:32:51,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:32:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-11-23 00:32:51,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 00:32:51,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:51,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:51,102 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:51,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:51,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1912036981, now seen corresponding path program 1 times [2018-11-23 00:32:51,102 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:51,102 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:51,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:51,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:51,175 INFO L478 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 [2018-11-23 00:32:51,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:51,184 INFO L478 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 [2018-11-23 00:32:51,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:51,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:51,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-23 00:32:51,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:51,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:51,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 00:32:51,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:51,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-23 00:32:51,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:51,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:32:51,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-11-23 00:32:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:51,265 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:51,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:51,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:32:51,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:32:51,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:32:51,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:51,267 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-11-23 00:32:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:51,932 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-11-23 00:32:51,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:32:51,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 00:32:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:51,934 INFO L225 Difference]: With dead ends: 153 [2018-11-23 00:32:51,934 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 00:32:51,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:32:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 00:32:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-11-23 00:32:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 00:32:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-11-23 00:32:51,938 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 16 [2018-11-23 00:32:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:51,938 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-11-23 00:32:51,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:32:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-11-23 00:32:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:32:51,939 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:51,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:51,939 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:51,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:51,940 INFO L82 PathProgramCache]: Analyzing trace with hash -778464745, now seen corresponding path program 1 times [2018-11-23 00:32:51,940 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:51,940 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:51,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:52,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:52,006 INFO L478 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 [2018-11-23 00:32:52,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 00:32:52,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 00:32:52,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:52,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 00:32:52,032 INFO L478 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 19 treesize of output 15 [2018-11-23 00:32:52,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 00:32:52,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-11-23 00:32:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:52,043 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:52,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:52,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:32:52,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:32:52,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:32:52,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:52,045 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 5 states. [2018-11-23 00:32:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:52,505 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2018-11-23 00:32:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:32:52,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 00:32:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:52,506 INFO L225 Difference]: With dead ends: 174 [2018-11-23 00:32:52,506 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 00:32:52,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:32:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 00:32:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2018-11-23 00:32:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 00:32:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-11-23 00:32:52,510 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 18 [2018-11-23 00:32:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:52,510 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-11-23 00:32:52,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:32:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-11-23 00:32:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:32:52,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:52,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:52,511 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:52,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash -778464744, now seen corresponding path program 1 times [2018-11-23 00:32:52,512 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:52,512 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:52,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:52,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:52,585 INFO L478 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 [2018-11-23 00:32:52,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 00:32:52,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 00:32:52,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:52,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 00:32:52,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:52,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,634 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-23 00:32:52,647 INFO L478 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 11 [2018-11-23 00:32:52,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:32:52,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 00:32:52,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 00:32:52,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:52,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-23 00:32:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:52,681 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:52,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:52,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:32:52,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:32:52,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:32:52,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:52,686 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 5 states. [2018-11-23 00:32:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:53,218 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2018-11-23 00:32:53,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:32:53,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 00:32:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:53,219 INFO L225 Difference]: With dead ends: 195 [2018-11-23 00:32:53,219 INFO L226 Difference]: Without dead ends: 195 [2018-11-23 00:32:53,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:32:53,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-23 00:32:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 130. [2018-11-23 00:32:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 00:32:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-11-23 00:32:53,222 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2018-11-23 00:32:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:53,222 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-11-23 00:32:53,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:32:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-11-23 00:32:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:32:53,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:53,222 INFO L402 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] [2018-11-23 00:32:53,223 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:53,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1741282714, now seen corresponding path program 1 times [2018-11-23 00:32:53,223 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:53,223 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:53,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:53,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:53,331 INFO L478 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 [2018-11-23 00:32:53,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 00:32:53,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:53,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:53,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 00:32:53,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 00:32:53,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-11-23 00:32:53,376 INFO L478 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 11 treesize of output 8 [2018-11-23 00:32:53,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:53,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,395 INFO L478 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 11 treesize of output 8 [2018-11-23 00:32:53,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:53,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-11-23 00:32:53,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-23 00:32:53,458 INFO L478 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 14 treesize of output 13 [2018-11-23 00:32:53,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-11-23 00:32:53,497 INFO L478 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 14 treesize of output 13 [2018-11-23 00:32:53,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:32:53,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-23 00:32:53,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 00:32:53,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 00:32:53,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:32:53,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-23 00:32:53,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 00:32:53,599 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 00:32:53,607 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,611 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:53,617 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-11-23 00:32:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:53,644 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:53,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:53,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 00:32:53,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 00:32:53,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 00:32:53,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:32:53,650 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 10 states. [2018-11-23 00:32:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:55,079 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2018-11-23 00:32:55,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 00:32:55,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 00:32:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:55,081 INFO L225 Difference]: With dead ends: 153 [2018-11-23 00:32:55,081 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 00:32:55,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-11-23 00:32:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 00:32:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-11-23 00:32:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 00:32:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-11-23 00:32:55,084 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 22 [2018-11-23 00:32:55,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:55,084 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-11-23 00:32:55,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 00:32:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-11-23 00:32:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:32:55,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:55,084 INFO L402 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] [2018-11-23 00:32:55,085 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:55,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1741282713, now seen corresponding path program 1 times [2018-11-23 00:32:55,085 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:55,085 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:55,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:55,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:55,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:32:55,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:55,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:32:55,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-23 00:32:55,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:55,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:55,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 00:32:55,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:55,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:55,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-23 00:32:55,240 INFO L478 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 11 treesize of output 8 [2018-11-23 00:32:55,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:55,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:55,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:55,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:55,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-11-23 00:32:55,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-23 00:32:55,322 INFO L478 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 14 treesize of output 13 [2018-11-23 00:32:55,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:55,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:55,343 INFO L267 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. [2018-11-23 00:32:55,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-23 00:32:55,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-11-23 00:32:55,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 00:32:55,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:55,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-23 00:32:55,398 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:55,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:55,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:32:55,406 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 00:32:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:55,439 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:55,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:55,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 00:32:55,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 00:32:55,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 00:32:55,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-11-23 00:32:55,441 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 11 states. [2018-11-23 00:32:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:56,541 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2018-11-23 00:32:56,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 00:32:56,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-23 00:32:56,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:56,543 INFO L225 Difference]: With dead ends: 168 [2018-11-23 00:32:56,543 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 00:32:56,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-11-23 00:32:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 00:32:56,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2018-11-23 00:32:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 00:32:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-11-23 00:32:56,545 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 22 [2018-11-23 00:32:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:56,546 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-11-23 00:32:56,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 00:32:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-11-23 00:32:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 00:32:56,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:56,546 INFO L402 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, 1, 1] [2018-11-23 00:32:56,547 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:56,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:56,547 INFO L82 PathProgramCache]: Analyzing trace with hash 913766270, now seen corresponding path program 1 times [2018-11-23 00:32:56,547 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:56,547 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:56,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:56,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:56,592 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:56,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:56,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:32:56,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:32:56,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:32:56,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:56,595 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 3 states. [2018-11-23 00:32:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:56,766 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-11-23 00:32:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:32:56,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 00:32:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:56,768 INFO L225 Difference]: With dead ends: 139 [2018-11-23 00:32:56,768 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 00:32:56,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:32:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 00:32:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2018-11-23 00:32:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 00:32:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-11-23 00:32:56,771 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 25 [2018-11-23 00:32:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:56,771 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-11-23 00:32:56,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:32:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-11-23 00:32:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 00:32:56,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:56,772 INFO L402 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, 1, 1] [2018-11-23 00:32:56,772 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:56,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:56,772 INFO L82 PathProgramCache]: Analyzing trace with hash 543815206, now seen corresponding path program 1 times [2018-11-23 00:32:56,773 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:56,773 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:56,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:56,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:56,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 00:32:56,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:56,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:56,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:56,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 00:32:56,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:56,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:56,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:56,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:56,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-11-23 00:32:56,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 00:32:56,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:56,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 00:32:56,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:56,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:56,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 00:32:56,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:56,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 00:32:56,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:56,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:56,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:56,974 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-23 00:32:57,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 00:32:57,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:57,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:57,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:57,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-23 00:32:57,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 00:32:57,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:57,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:57,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:32:57,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-23 00:32:57,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-11-23 00:32:57,158 INFO L478 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 22 treesize of output 16 [2018-11-23 00:32:57,160 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 00:32:57,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,176 INFO L478 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 22 treesize of output 16 [2018-11-23 00:32:57,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-23 00:32:57,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2018-11-23 00:32:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:57,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:32:57,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:32:57,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:32:57,394 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,403 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:57,421 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:32:57,423 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:32:57,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 00:32:57,429 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:97, output treesize:25 [2018-11-23 00:32:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:57,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:32:57,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-23 00:32:57,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 00:32:57,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 00:32:57,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 00:32:57,463 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 13 states. [2018-11-23 00:32:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:58,586 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2018-11-23 00:32:58,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:32:58,587 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-23 00:32:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:58,588 INFO L225 Difference]: With dead ends: 186 [2018-11-23 00:32:58,588 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 00:32:58,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-11-23 00:32:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 00:32:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 144. [2018-11-23 00:32:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 00:32:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-11-23 00:32:58,591 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 28 [2018-11-23 00:32:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:58,591 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-11-23 00:32:58,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 00:32:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-11-23 00:32:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 00:32:58,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:58,592 INFO L402 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, 1, 1, 1, 1, 1] [2018-11-23 00:32:58,592 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:58,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:58,593 INFO L82 PathProgramCache]: Analyzing trace with hash 967974238, now seen corresponding path program 1 times [2018-11-23 00:32:58,593 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:58,593 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:58,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:58,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:58,673 INFO L478 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 [2018-11-23 00:32:58,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:58,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:58,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 00:32:58,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 00:32:58,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:58,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:58,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:58,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:58,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-23 00:32:58,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 00:32:58,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 00:32:58,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:58,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:58,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:58,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 00:32:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:58,706 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:58,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:58,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:32:58,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:32:58,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:32:58,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:58,709 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2018-11-23 00:32:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:32:59,266 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-11-23 00:32:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:32:59,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 00:32:59,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:32:59,267 INFO L225 Difference]: With dead ends: 206 [2018-11-23 00:32:59,267 INFO L226 Difference]: Without dead ends: 206 [2018-11-23 00:32:59,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:32:59,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-23 00:32:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 143. [2018-11-23 00:32:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 00:32:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-11-23 00:32:59,270 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 28 [2018-11-23 00:32:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:32:59,270 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-11-23 00:32:59,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:32:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-11-23 00:32:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 00:32:59,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:32:59,271 INFO L402 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, 1, 1, 1, 1, 1] [2018-11-23 00:32:59,271 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:32:59,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash 967974239, now seen corresponding path program 1 times [2018-11-23 00:32:59,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:32:59,272 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:32:59,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:59,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:59,382 INFO L478 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 [2018-11-23 00:32:59,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 00:32:59,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 00:32:59,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:59,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 00:32:59,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:32:59,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-23 00:32:59,432 INFO L478 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 11 [2018-11-23 00:32:59,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:32:59,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 00:32:59,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 00:32:59,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:32:59,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-23 00:32:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:59,459 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:32:59,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:32:59,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:32:59,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:32:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:32:59,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:32:59,462 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 5 states. [2018-11-23 00:33:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:33:00,093 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-11-23 00:33:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:33:00,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 00:33:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:33:00,095 INFO L225 Difference]: With dead ends: 227 [2018-11-23 00:33:00,095 INFO L226 Difference]: Without dead ends: 227 [2018-11-23 00:33:00,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:33:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-23 00:33:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 142. [2018-11-23 00:33:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 00:33:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-11-23 00:33:00,099 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 28 [2018-11-23 00:33:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:33:00,100 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-11-23 00:33:00,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:33:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-11-23 00:33:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 00:33:00,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:00,101 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:00,101 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:33:00,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:00,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1505831504, now seen corresponding path program 1 times [2018-11-23 00:33:00,102 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:33:00,102 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:33:00,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:00,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:33:00,153 INFO L478 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 19 treesize of output 15 [2018-11-23 00:33:00,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 00:33:00,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-23 00:33:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:33:00,163 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:33:00,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:33:00,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:33:00,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:33:00,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:33:00,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:33:00,165 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 5 states. [2018-11-23 00:33:00,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:33:00,518 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-11-23 00:33:00,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:33:00,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 00:33:00,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:33:00,519 INFO L225 Difference]: With dead ends: 145 [2018-11-23 00:33:00,520 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 00:33:00,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:33:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 00:33:00,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-11-23 00:33:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 00:33:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-11-23 00:33:00,522 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 29 [2018-11-23 00:33:00,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:33:00,523 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-11-23 00:33:00,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:33:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-11-23 00:33:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 00:33:00,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:00,523 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:00,524 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:33:00,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:00,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1379592124, now seen corresponding path program 1 times [2018-11-23 00:33:00,524 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:33:00,524 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:33:00,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:00,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:33:00,591 INFO L478 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 [2018-11-23 00:33:00,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 00:33:00,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:33:00,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:33:00,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 00:33:00,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-23 00:33:00,609 INFO L478 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 7 treesize of output 5 [2018-11-23 00:33:00,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 00:33:00,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:4 [2018-11-23 00:33:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 00:33:00,616 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:33:00,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:33:00,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:33:00,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:33:00,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:33:00,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:33:00,619 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 4 states. [2018-11-23 00:33:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:33:00,816 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-11-23 00:33:00,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:33:00,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 00:33:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:33:00,818 INFO L225 Difference]: With dead ends: 170 [2018-11-23 00:33:00,818 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 00:33:00,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:33:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 00:33:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 141. [2018-11-23 00:33:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 00:33:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-11-23 00:33:00,822 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 30 [2018-11-23 00:33:00,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:33:00,823 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-11-23 00:33:00,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:33:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-11-23 00:33:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 00:33:00,823 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:00,824 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:00,824 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:33:00,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:00,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1365570400, now seen corresponding path program 1 times [2018-11-23 00:33:00,825 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:33:00,825 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:33:00,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:00,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:33:00,987 INFO L478 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 7 treesize of output 5 [2018-11-23 00:33:00,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 00:33:00,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:00,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:7, output treesize:1 [2018-11-23 00:33:01,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:33:01,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:33:01,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 00:33:01,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:01,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:01,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-23 00:33:01,019 INFO L478 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 11 treesize of output 8 [2018-11-23 00:33:01,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:33:01,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:01,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:01,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:01,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2018-11-23 00:33:01,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-23 00:33:01,081 INFO L478 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 14 treesize of output 13 [2018-11-23 00:33:01,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:01,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:01,100 INFO L267 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. [2018-11-23 00:33:01,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-11-23 00:33:01,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-23 00:33:01,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 00:33:01,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:01,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 00:33:01,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:01,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:01,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:33:01,145 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:16 [2018-11-23 00:33:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:33:01,169 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:33:01,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:33:01,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 00:33:01,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 00:33:01,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 00:33:01,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:33:01,172 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 9 states. [2018-11-23 00:33:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:33:01,900 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-11-23 00:33:01,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 00:33:01,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 00:33:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:33:01,901 INFO L225 Difference]: With dead ends: 147 [2018-11-23 00:33:01,901 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 00:33:01,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:33:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 00:33:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2018-11-23 00:33:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 00:33:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-11-23 00:33:01,904 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 32 [2018-11-23 00:33:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:33:01,904 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-11-23 00:33:01,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 00:33:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-11-23 00:33:01,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 00:33:01,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:01,904 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:01,905 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:33:01,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:01,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1365570399, now seen corresponding path program 1 times [2018-11-23 00:33:01,905 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:33:01,905 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:33:01,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:02,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:33:02,075 INFO L478 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 [2018-11-23 00:33:02,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 00:33:02,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:33:02,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:33:02,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 00:33:02,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-23 00:33:02,105 INFO L478 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 11 treesize of output 8 [2018-11-23 00:33:02,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:33:02,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-11-23 00:33:02,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-23 00:33:02,155 INFO L478 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 14 treesize of output 13 [2018-11-23 00:33:02,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,174 INFO L267 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. [2018-11-23 00:33:02,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-23 00:33:02,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-11-23 00:33:02,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 00:33:02,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-23 00:33:02,213 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:33:02,221 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 00:33:02,251 INFO L478 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 [2018-11-23 00:33:02,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:33:02,263 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:33:02,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 00:33:02,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:13 [2018-11-23 00:33:02,300 INFO L478 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 11 treesize of output 8 [2018-11-23 00:33:02,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:33:02,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,322 INFO L478 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 11 treesize of output 8 [2018-11-23 00:33:02,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:33:02,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-11-23 00:33:02,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-23 00:33:02,401 INFO L478 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 14 treesize of output 13 [2018-11-23 00:33:02,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-23 00:33:02,448 INFO L478 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 14 treesize of output 13 [2018-11-23 00:33:02,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:33:02,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-23 00:33:02,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 00:33:02,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 00:33:02,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:33:02,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-23 00:33:02,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 00:33:02,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 00:33:02,556 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,560 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:02,565 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-11-23 00:33:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:33:02,604 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:33:02,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:33:02,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 00:33:02,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 00:33:02,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 00:33:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 00:33:02,606 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 16 states. [2018-11-23 00:33:03,865 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-23 00:33:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:33:04,958 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-11-23 00:33:04,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 00:33:04,958 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-11-23 00:33:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:33:04,959 INFO L225 Difference]: With dead ends: 145 [2018-11-23 00:33:04,959 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 00:33:04,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 00:33:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 00:33:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2018-11-23 00:33:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 00:33:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-11-23 00:33:04,962 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 32 [2018-11-23 00:33:04,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:33:04,963 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-11-23 00:33:04,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 00:33:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-11-23 00:33:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 00:33:04,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:04,963 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:04,964 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:33:04,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1026314670, now seen corresponding path program 1 times [2018-11-23 00:33:04,964 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:33:04,964 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:33:04,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:05,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:33:05,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 00:33:05,041 INFO L478 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 10 treesize of output 9 [2018-11-23 00:33:05,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-23 00:33:05,052 INFO L478 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 19 treesize of output 15 [2018-11-23 00:33:05,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 00:33:05,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-23 00:33:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 00:33:05,060 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:33:05,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:33:05,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:33:05,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:33:05,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:33:05,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:33:05,063 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 4 states. [2018-11-23 00:33:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:33:05,238 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-11-23 00:33:05,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:33:05,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 00:33:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:33:05,239 INFO L225 Difference]: With dead ends: 127 [2018-11-23 00:33:05,239 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 00:33:05,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:33:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 00:33:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-11-23 00:33:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 00:33:05,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-11-23 00:33:05,241 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 35 [2018-11-23 00:33:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:33:05,242 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-11-23 00:33:05,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:33:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 00:33:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 00:33:05,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:05,242 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:05,242 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:33:05,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:05,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1871682050, now seen corresponding path program 1 times [2018-11-23 00:33:05,243 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:33:05,243 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:33:05,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:05,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:33:05,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-23 00:33:05,338 INFO L478 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 16 treesize of output 1 [2018-11-23 00:33:05,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-23 00:33:05,359 INFO L478 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 16 treesize of output 1 [2018-11-23 00:33:05,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,360 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2018-11-23 00:33:05,416 INFO L478 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 11 [2018-11-23 00:33:05,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:33:05,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,432 INFO L478 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 11 [2018-11-23 00:33:05,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:33:05,435 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:33:05,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 00:33:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:33:05,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:33:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:33:05,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:33:05,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-11-23 00:33:05,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 00:33:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 00:33:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:33:05,618 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 14 states. [2018-11-23 00:33:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:33:07,088 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2018-11-23 00:33:07,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 00:33:07,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-11-23 00:33:07,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:33:07,089 INFO L225 Difference]: With dead ends: 173 [2018-11-23 00:33:07,089 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 00:33:07,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-11-23 00:33:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 00:33:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 132. [2018-11-23 00:33:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 00:33:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2018-11-23 00:33:07,092 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 36 [2018-11-23 00:33:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:33:07,092 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-11-23 00:33:07,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 00:33:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-11-23 00:33:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 00:33:07,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:07,093 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:07,093 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-23 00:33:07,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:07,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2107399152, now seen corresponding path program 1 times [2018-11-23 00:33:07,094 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 00:33:07,094 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8117c893-38af-4654-b307-95e8471f9af5/bin-2019/uautomizer/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 00:33:07,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:33:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:33:07,323 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] RET #284#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret21 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32); srcloc: L988 VAL [main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32); srcloc: L988-1 VAL [main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32); srcloc: L989 VAL [main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L993 VAL [main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L993-1 VAL [main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); srcloc: L994 VAL [main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(0bv32 != #t~nondet2);havoc #t~nondet2; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] goto; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); srcloc: L1031-3 VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~mem12|=(_ bv1 32)] [?] assume !!(~unnamed1~0~BLACK == #t~mem12);havoc #t~mem12; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] goto; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call #t~mem13 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); srcloc: L1034 VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~mem13|=(_ bv1 32)] [?] assume !(~unnamed1~0~RED == #t~mem13);havoc #t~mem13; VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1034-2 VAL [main_~end~0.base=(_ bv4294967294 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~mem16.base|=(_ bv1 32), |main_#t~mem16.offset|=(_ bv0 32)] [?] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call #t~mem17 := read~intINTTYPE4(~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); srcloc: L1047 VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~mem17|=(_ bv1 32)] [?] assume !(~unnamed1~0~RED == #t~mem17);havoc #t~mem17; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4bv32); srcloc: L1056 VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~mem20.base|=(_ bv1 32), |main_#t~mem20.offset|=(_ bv0 32)] [?] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset;havoc #t~mem20.base, #t~mem20.offset; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume 0bv32 == ~list~0.offset; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv4294967294 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume 0bv32 == ~list~0.base || 1bv1 == #valid[~list~0.base];call ULTIMATE.dealloc(~list~0.base, ~list~0.offset);~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv1 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv1 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] #res := 0bv32; VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv1 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#res|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(#valid == old(#valid)); VAL [main_~end~0.base=(_ bv1 32), main_~end~0.offset=(_ bv0 32), main_~list~0.base=(_ bv1 32), main_~list~0.offset=(_ bv0 32), main_~null~0.base=(_ bv1 32), main_~null~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#res|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv4294967294 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L988] call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L989] call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L990] call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L995] call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1000-L1024] assume !(0bv32 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1031] call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem12=1bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1034] call #t~mem13 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem13=1bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem16.base=1bv32, #t~mem16.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1032-L1042] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1045-L1060] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1047] call #t~mem17 := read~intINTTYPE4(~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem17=1bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1047-L1059] assume !(~unnamed1~0~RED == #t~mem17); [L1047] havoc #t~mem17; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1056] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem20.base=1bv32, #t~mem20.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1056] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset; [L1056] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1057] assert 0bv32 == ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1057] assert 0bv32 == ~list~0.base || 1bv1 == #valid[~list~0.base]; [L1057] call ULTIMATE.dealloc(~list~0.base, ~list~0.offset); [L1058] ~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1045-L1060] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1062] #res := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L985-L1063] ensures #valid == old(#valid); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] ----- [2018-11-23 00:33:07,346 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L988] call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L989] call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L990] call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L995] call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1000-L1024] assume !(0bv32 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1031] call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem12=1bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1034] call #t~mem13 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem13=1bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem16.base=1bv32, #t~mem16.offset=0bv32, ~end~0.base=4294967294bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1032-L1042] assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1045-L1060] assume !!(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1047] call #t~mem17 := read~intINTTYPE4(~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem17=1bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1047-L1059] assume !(~unnamed1~0~RED == #t~mem17); [L1047] havoc #t~mem17; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1056] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, #t~mem20.base=1bv32, #t~mem20.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1056] ~end~0.base, ~end~0.offset := #t~mem20.base, #t~mem20.offset; [L1056] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1057] assert 0bv32 == ~list~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=4294967294bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1057] assert 0bv32 == ~list~0.base || 1bv1 == #valid[~list~0.base]; [L1057] call ULTIMATE.dealloc(~list~0.base, ~list~0.offset); [L1058] ~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1045-L1060] assume !(~null~0.base != ~list~0.base || ~null~0.offset != ~list~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L1062] #res := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [L985-L1063] ensures #valid == old(#valid); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~malloc1.base=4294967294bv32, #t~malloc1.offset=0bv32, ~end~0.base=1bv32, ~end~0.offset=0bv32, ~list~0.base=1bv32, ~list~0.offset=0bv32, ~null~0.base=1bv32, ~null~0.offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12bv32); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L988] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~null~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L989] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~bvadd32(4bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L990] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~null~0!base, offset: ~bvadd32(8bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12bv32); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~bvadd32(4bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L995] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1000-L1024] COND TRUE !(0bv32 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] FCALL call #t~mem12 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem12=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] FCALL call #t~mem13 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem13=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem16!base=1bv32, #t~mem16!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] FCALL call #t~mem17 := read~intINTTYPE4({ base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem17=1bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem20!base=1bv32, #t~mem20!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!offset; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!base || 1bv1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1062] #res := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12bv32); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L988] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~null~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L989] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~null~0!base, offset: ~bvadd32(4bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L990] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~null~0!base, offset: ~bvadd32(8bv32, ~null~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12bv32); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~bvadd32(4bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L995] FCALL call write~intINTTYPE4(~unnamed1~0~BLACK, { base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1000-L1024] COND TRUE !(0bv32 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] FCALL call #t~mem12 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem12=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] FCALL call #t~mem13 := read~intINTTYPE4({ base: ~end~0!base, offset: ~bvadd32(8bv32, ~end~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem13=1bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem16!base=1bv32, #t~mem16!offset=0bv32, ~end~0!base=4294967294bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] FCALL call #t~mem17 := read~intINTTYPE4({ base: ~list~0!base, offset: ~bvadd32(8bv32, ~list~0!offset) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem17=1bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, #t~mem20!base=1bv32, #t~mem20!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!offset; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=4294967294bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1057] assert 0bv32 == ~list~0!base || 1bv1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L1062] #res := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~malloc1!base=4294967294bv32, #t~malloc1!offset=0bv32, ~end~0!base=1bv32, ~end~0!offset=0bv32, ~list~0!base=1bv32, ~list~0!offset=0bv32, ~null~0!base=1bv32, ~null~0!offset=0bv32] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L993] list->next = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L994] list->prev = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L995] list->colour = BLACK VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L997] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1031] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1034] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={-2:0}, end->next={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1045] COND TRUE null != list VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1047] EXPR list->colour VAL [end={1:0}, list={-2:0}, list->colour=1, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={1:0}, list={-2:0}, list->next={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1056] end = list->next [L1057] free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1057] free(list) [L1058] list = end VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1045] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1062] return 0; VAL [\result=0, end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] ----- [2018-11-23 00:33:07,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:33:07 BoogieIcfgContainer [2018-11-23 00:33:07,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:33:07,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:33:07,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:33:07,376 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:33:07,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:32:49" (3/4) ... [2018-11-23 00:33:07,380 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:33:07,380 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:33:07,380 INFO L168 Benchmark]: Toolchain (without parser) took 19382.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.8 MB). Free memory was 943.3 MB in the beginning and 1.3 GB in the end (delta: -309.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:07,381 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:33:07,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:07,381 INFO L168 Benchmark]: Boogie Preprocessor took 48.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:33:07,381 INFO L168 Benchmark]: RCFGBuilder took 670.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:07,381 INFO L168 Benchmark]: TraceAbstraction took 18264.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -207.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:33:07,381 INFO L168 Benchmark]: Witness Printer took 5.18 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:33:07,382 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 670.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18264.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -207.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.18 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L993] list->next = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L994] list->prev = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L995] list->colour = BLACK VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L997] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1031] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1034] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={-2:0}, end->next={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1045] COND TRUE null != list VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1047] EXPR list->colour VAL [end={1:0}, list={-2:0}, list->colour=1, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={1:0}, list={-2:0}, list->next={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1056] end = list->next [L1057] free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1057] free(list) [L1058] list = end VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1045] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1062] return 0; VAL [\result=0, end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 147 locations, 67 error locations. UNSAFE Result, 18.2s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1667 SDtfs, 2723 SDslu, 3057 SDs, 0 SdLazy, 4994 SolverSat, 270 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 399 SyntacticMatches, 5 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 548 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 488 NumberOfCodeBlocks, 488 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 493 ConstructedInterpolants, 27 QuantifiedInterpolants, 92839 SizeOfPredicates, 135 NumberOfNonLiveVariables, 2159 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...