./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety/lockfree-3.1_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety/lockfree-3.1_false-valid-memtrack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 1cf39fe39780d3a80771c5bc79874b49e3ac2315 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety/lockfree-3.1_false-valid-memtrack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 1cf39fe39780d3a80771c5bc79874b49e3ac2315 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 22:09:53,131 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:09:53,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:09:53,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:09:53,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:09:53,154 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:09:53,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:09:53,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:09:53,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:09:53,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:09:53,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:09:53,177 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:09:53,179 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:09:53,179 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:09:53,181 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:09:53,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:09:53,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:09:53,195 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:09:53,198 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:09:53,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:09:53,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:09:53,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:09:53,209 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:09:53,212 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:09:53,212 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:09:53,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:09:53,214 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:09:53,217 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:09:53,218 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:09:53,218 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:09:53,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:09:53,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:09:53,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:09:53,224 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:09:53,225 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:09:53,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:09:53,226 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 22:09:53,258 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:09:53,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:09:53,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:09:53,262 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:09:53,262 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:09:53,262 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:09:53,262 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:09:53,262 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:09:53,263 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:09:53,264 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:09:53,264 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:09:53,264 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:09:53,264 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:09:53,264 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:09:53,265 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:09:53,265 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:09:53,265 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:09:53,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:09:53,265 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:09:53,265 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:09:53,268 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:09:53,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:09:53,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:09:53,269 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:09:53,269 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:09:53,269 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:09:53,269 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 1cf39fe39780d3a80771c5bc79874b49e3ac2315 [2019-01-13 22:09:53,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:09:53,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:09:53,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:09:53,366 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:09:53,366 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:09:53,367 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/lockfree-3.1_false-valid-memtrack.i [2019-01-13 22:09:53,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a93d16a0/539fd1d96f9b4e9a8b7d002ea513165d/FLAG19ddb06a5 [2019-01-13 22:09:53,863 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:09:53,863 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/lockfree-3.1_false-valid-memtrack.i [2019-01-13 22:09:53,877 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a93d16a0/539fd1d96f9b4e9a8b7d002ea513165d/FLAG19ddb06a5 [2019-01-13 22:09:54,200 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a93d16a0/539fd1d96f9b4e9a8b7d002ea513165d [2019-01-13 22:09:54,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:09:54,205 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:09:54,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:09:54,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:09:54,210 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:09:54,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:09:54" (1/1) ... [2019-01-13 22:09:54,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ff059c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:09:54, skipping insertion in model container [2019-01-13 22:09:54,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:09:54" (1/1) ... [2019-01-13 22:09:54,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:09:54,272 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:09:54,656 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:09:54,669 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:09:54,826 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:09:54,887 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:09:54,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:09:54 WrapperNode [2019-01-13 22:09:54,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:09:54,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:09:54,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:09:54,889 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:09:54,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:09:54" (1/1) ... [2019-01-13 22:09:54,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:09:54" (1/1) ... [2019-01-13 22:09:54,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:09:54" (1/1) ... [2019-01-13 22:09:54,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:09:54" (1/1) ... [2019-01-13 22:09:54,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:09:54" (1/1) ... [2019-01-13 22:09:54,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:09:54" (1/1) ... [2019-01-13 22:09:54,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:09:54" (1/1) ... [2019-01-13 22:09:54,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:09:54,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:09:54,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:09:54,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:09:54,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:09:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-13 22:09:55,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:09:55,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:09:55,044 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2019-01-13 22:09:55,044 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2019-01-13 22:09:55,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:09:55,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 22:09:55,045 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:09:55,045 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:09:55,047 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:09:55,047 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:09:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:09:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:09:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:09:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:09:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:09:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:09:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:09:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:09:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:09:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:09:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:09:55,051 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:09:55,051 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:09:55,051 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:09:55,052 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:09:55,053 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:09:55,053 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:09:55,054 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:09:55,054 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:09:55,054 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:09:55,054 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:09:55,054 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:09:55,054 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:09:55,055 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:09:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:09:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:09:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:09:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:09:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:09:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:09:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:09:55,058 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:09:55,058 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:09:55,058 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:09:55,058 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:09:55,058 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:09:55,058 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:09:55,059 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:09:55,059 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:09:55,059 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:09:55,059 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:09:55,059 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:09:55,059 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:09:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:09:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:09:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:09:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:09:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:09:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:09:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:09:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:09:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:09:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:09:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:09:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:09:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:09:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:09:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:09:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:09:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:09:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 22:09:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:09:55,066 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:09:55,067 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:09:55,067 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:09:55,067 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:09:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:09:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:09:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:09:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:09:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:09:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:09:55,068 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:09:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:09:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:09:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:09:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:09:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:09:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:09:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:09:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:09:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:09:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:09:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:09:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:09:55,072 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:09:55,073 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:09:55,073 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:09:55,073 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:09:55,074 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:09:55,074 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:09:55,074 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:09:55,074 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:09:55,075 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:09:55,075 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:09:55,075 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:09:55,075 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:09:55,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:09:55,075 INFO L130 BoogieDeclarations]: Found specification of procedure push [2019-01-13 22:09:55,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:09:55,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 22:09:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:09:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2019-01-13 22:09:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:09:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 22:09:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:09:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:09:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:09:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:09:56,059 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:09:56,060 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 22:09:56,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:09:56 BoogieIcfgContainer [2019-01-13 22:09:56,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:09:56,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:09:56,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:09:56,066 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:09:56,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:09:54" (1/3) ... [2019-01-13 22:09:56,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4778d8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:09:56, skipping insertion in model container [2019-01-13 22:09:56,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:09:54" (2/3) ... [2019-01-13 22:09:56,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4778d8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:09:56, skipping insertion in model container [2019-01-13 22:09:56,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:09:56" (3/3) ... [2019-01-13 22:09:56,069 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2019-01-13 22:09:56,080 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:09:56,089 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-13 22:09:56,108 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-13 22:09:56,137 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:09:56,138 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:09:56,138 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:09:56,138 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:09:56,142 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:09:56,143 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:09:56,143 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:09:56,143 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:09:56,144 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:09:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-01-13 22:09:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-13 22:09:56,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:09:56,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:09:56,189 INFO L423 AbstractCegarLoop]: === Iteration 1 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:09:56,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:09:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1052716832, now seen corresponding path program 1 times [2019-01-13 22:09:56,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:09:56,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:09:56,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:56,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:09:56,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:09:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:09:56,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:09:56,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:09:56,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-13 22:09:56,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-13 22:09:56,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 22:09:56,449 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2019-01-13 22:09:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:09:56,468 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2019-01-13 22:09:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-13 22:09:56,470 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-13 22:09:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:09:56,485 INFO L225 Difference]: With dead ends: 74 [2019-01-13 22:09:56,486 INFO L226 Difference]: Without dead ends: 71 [2019-01-13 22:09:56,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 22:09:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-13 22:09:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-13 22:09:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-13 22:09:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-01-13 22:09:56,545 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 8 [2019-01-13 22:09:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:09:56,546 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-01-13 22:09:56,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-13 22:09:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-01-13 22:09:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:09:56,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:09:56,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:09:56,549 INFO L423 AbstractCegarLoop]: === Iteration 2 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:09:56,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:09:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1931190033, now seen corresponding path program 1 times [2019-01-13 22:09:56,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:09:56,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:09:56,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:56,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:09:56,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:09:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:09:56,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:09:56,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:09:56,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:09:56,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:09:56,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:09:56,658 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 3 states. [2019-01-13 22:09:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:09:56,715 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2019-01-13 22:09:56,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:09:56,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:09:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:09:56,719 INFO L225 Difference]: With dead ends: 72 [2019-01-13 22:09:56,719 INFO L226 Difference]: Without dead ends: 72 [2019-01-13 22:09:56,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:09:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-13 22:09:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-13 22:09:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-13 22:09:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-01-13 22:09:56,733 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 10 [2019-01-13 22:09:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:09:56,733 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-01-13 22:09:56,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:09:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-01-13 22:09:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:09:56,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:09:56,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:09:56,736 INFO L423 AbstractCegarLoop]: === Iteration 3 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:09:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:09:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1931249615, now seen corresponding path program 1 times [2019-01-13 22:09:56,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:09:56,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:09:56,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:56,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:09:56,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:09:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:09:56,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:09:56,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:09:56,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:09:56,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:09:56,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:09:56,888 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 3 states. [2019-01-13 22:09:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:09:57,008 INFO L93 Difference]: Finished difference Result 126 states and 161 transitions. [2019-01-13 22:09:57,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:09:57,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:09:57,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:09:57,012 INFO L225 Difference]: With dead ends: 126 [2019-01-13 22:09:57,012 INFO L226 Difference]: Without dead ends: 126 [2019-01-13 22:09:57,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:09:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-13 22:09:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2019-01-13 22:09:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 22:09:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2019-01-13 22:09:57,045 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 10 [2019-01-13 22:09:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:09:57,045 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2019-01-13 22:09:57,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:09:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2019-01-13 22:09:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:09:57,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:09:57,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:09:57,049 INFO L423 AbstractCegarLoop]: === Iteration 4 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:09:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:09:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash -260805484, now seen corresponding path program 1 times [2019-01-13 22:09:57,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:09:57,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:09:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:57,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:09:57,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:09:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:09:57,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:09:57,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:09:57,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:09:57,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:09:57,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:09:57,173 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2019-01-13 22:09:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:09:57,297 INFO L93 Difference]: Finished difference Result 140 states and 198 transitions. [2019-01-13 22:09:57,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:09:57,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 22:09:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:09:57,301 INFO L225 Difference]: With dead ends: 140 [2019-01-13 22:09:57,301 INFO L226 Difference]: Without dead ends: 137 [2019-01-13 22:09:57,302 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 [2019-01-13 22:09:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-13 22:09:57,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 126. [2019-01-13 22:09:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-13 22:09:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2019-01-13 22:09:57,324 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 11 [2019-01-13 22:09:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:09:57,325 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2019-01-13 22:09:57,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:09:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2019-01-13 22:09:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 22:09:57,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:09:57,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:09:57,326 INFO L423 AbstractCegarLoop]: === Iteration 5 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:09:57,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:09:57,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1038361485, now seen corresponding path program 1 times [2019-01-13 22:09:57,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:09:57,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:09:57,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:57,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:09:57,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:09:57,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:09:57,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:09:57,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:09:57,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:09:57,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:09:57,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:09:57,401 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand 3 states. [2019-01-13 22:09:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:09:57,745 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-01-13 22:09:57,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:09:57,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-13 22:09:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:09:57,751 INFO L225 Difference]: With dead ends: 214 [2019-01-13 22:09:57,752 INFO L226 Difference]: Without dead ends: 214 [2019-01-13 22:09:57,752 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 [2019-01-13 22:09:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-13 22:09:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 193. [2019-01-13 22:09:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-13 22:09:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 298 transitions. [2019-01-13 22:09:57,772 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 298 transitions. Word has length 13 [2019-01-13 22:09:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:09:57,772 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 298 transitions. [2019-01-13 22:09:57,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:09:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 298 transitions. [2019-01-13 22:09:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 22:09:57,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:09:57,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:09:57,774 INFO L423 AbstractCegarLoop]: === Iteration 6 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:09:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:09:57,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1038361486, now seen corresponding path program 1 times [2019-01-13 22:09:57,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:09:57,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:09:57,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:57,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:09:57,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:09:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:09:57,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:09:57,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:09:57,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:09:57,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:09:57,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:09:57,855 INFO L87 Difference]: Start difference. First operand 193 states and 298 transitions. Second operand 3 states. [2019-01-13 22:09:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:09:57,997 INFO L93 Difference]: Finished difference Result 265 states and 395 transitions. [2019-01-13 22:09:57,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:09:57,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-13 22:09:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:09:58,001 INFO L225 Difference]: With dead ends: 265 [2019-01-13 22:09:58,001 INFO L226 Difference]: Without dead ends: 265 [2019-01-13 22:09:58,003 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 [2019-01-13 22:09:58,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-13 22:09:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2019-01-13 22:09:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-13 22:09:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 382 transitions. [2019-01-13 22:09:58,026 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 382 transitions. Word has length 13 [2019-01-13 22:09:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:09:58,031 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 382 transitions. [2019-01-13 22:09:58,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:09:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 382 transitions. [2019-01-13 22:09:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 22:09:58,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:09:58,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:09:58,032 INFO L423 AbstractCegarLoop]: === Iteration 7 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:09:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:09:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2124441954, now seen corresponding path program 1 times [2019-01-13 22:09:58,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:09:58,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:09:58,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:58,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:09:58,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:09:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:09:58,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:09:58,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:09:58,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:09:58,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:09:58,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:09:58,158 INFO L87 Difference]: Start difference. First operand 247 states and 382 transitions. Second operand 5 states. [2019-01-13 22:09:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:09:58,522 INFO L93 Difference]: Finished difference Result 467 states and 697 transitions. [2019-01-13 22:09:58,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:09:58,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-13 22:09:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:09:58,530 INFO L225 Difference]: With dead ends: 467 [2019-01-13 22:09:58,531 INFO L226 Difference]: Without dead ends: 467 [2019-01-13 22:09:58,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:09:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-01-13 22:09:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 439. [2019-01-13 22:09:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-01-13 22:09:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 675 transitions. [2019-01-13 22:09:58,555 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 675 transitions. Word has length 14 [2019-01-13 22:09:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:09:58,556 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 675 transitions. [2019-01-13 22:09:58,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:09:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 675 transitions. [2019-01-13 22:09:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:09:58,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:09:58,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:09:58,559 INFO L423 AbstractCegarLoop]: === Iteration 8 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:09:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:09:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash -98286522, now seen corresponding path program 1 times [2019-01-13 22:09:58,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:09:58,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:09:58,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:58,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:09:58,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:09:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:09:58,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:09:58,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:09:58,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:09:58,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:09:58,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:09:58,658 INFO L87 Difference]: Start difference. First operand 439 states and 675 transitions. Second operand 5 states. [2019-01-13 22:09:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:09:58,830 INFO L93 Difference]: Finished difference Result 819 states and 1183 transitions. [2019-01-13 22:09:58,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:09:58,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-13 22:09:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:09:58,839 INFO L225 Difference]: With dead ends: 819 [2019-01-13 22:09:58,839 INFO L226 Difference]: Without dead ends: 819 [2019-01-13 22:09:58,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:09:58,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-01-13 22:09:58,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 787. [2019-01-13 22:09:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-01-13 22:09:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1155 transitions. [2019-01-13 22:09:58,889 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1155 transitions. Word has length 15 [2019-01-13 22:09:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:09:58,889 INFO L480 AbstractCegarLoop]: Abstraction has 787 states and 1155 transitions. [2019-01-13 22:09:58,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:09:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1155 transitions. [2019-01-13 22:09:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 22:09:58,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:09:58,891 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] [2019-01-13 22:09:58,892 INFO L423 AbstractCegarLoop]: === Iteration 9 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:09:58,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:09:58,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1015802146, now seen corresponding path program 1 times [2019-01-13 22:09:58,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:09:58,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:09:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:58,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:09:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:09:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:09:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:09:59,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:09:59,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-13 22:09:59,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:09:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:09:59,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:09:59,665 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-13 22:09:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:09:59,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:09:59,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-01-13 22:09:59,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 22:09:59,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 22:09:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-13 22:09:59,831 INFO L87 Difference]: Start difference. First operand 787 states and 1155 transitions. Second operand 11 states. [2019-01-13 22:10:00,137 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 22:10:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:02,180 INFO L93 Difference]: Finished difference Result 1805 states and 2913 transitions. [2019-01-13 22:10:02,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-13 22:10:02,181 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-13 22:10:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:02,194 INFO L225 Difference]: With dead ends: 1805 [2019-01-13 22:10:02,194 INFO L226 Difference]: Without dead ends: 1805 [2019-01-13 22:10:02,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2019-01-13 22:10:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-01-13 22:10:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1453. [2019-01-13 22:10:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1453 states. [2019-01-13 22:10:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2234 transitions. [2019-01-13 22:10:02,276 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2234 transitions. Word has length 22 [2019-01-13 22:10:02,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:02,277 INFO L480 AbstractCegarLoop]: Abstraction has 1453 states and 2234 transitions. [2019-01-13 22:10:02,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 22:10:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2234 transitions. [2019-01-13 22:10:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 22:10:02,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:02,279 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:02,279 INFO L423 AbstractCegarLoop]: === Iteration 10 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:02,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:02,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1942462142, now seen corresponding path program 1 times [2019-01-13 22:10:02,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:02,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:02,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:02,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:02,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:02,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:02,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-13 22:10:02,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:02,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:02,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:02,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-13 22:10:02,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:10:02,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:10:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:10:02,534 INFO L87 Difference]: Start difference. First operand 1453 states and 2234 transitions. Second operand 6 states. [2019-01-13 22:10:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:02,947 INFO L93 Difference]: Finished difference Result 2247 states and 3370 transitions. [2019-01-13 22:10:02,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:10:02,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-01-13 22:10:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:02,964 INFO L225 Difference]: With dead ends: 2247 [2019-01-13 22:10:02,965 INFO L226 Difference]: Without dead ends: 2247 [2019-01-13 22:10:02,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:10:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2019-01-13 22:10:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2155. [2019-01-13 22:10:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2155 states. [2019-01-13 22:10:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3282 transitions. [2019-01-13 22:10:03,053 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3282 transitions. Word has length 24 [2019-01-13 22:10:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:03,054 INFO L480 AbstractCegarLoop]: Abstraction has 2155 states and 3282 transitions. [2019-01-13 22:10:03,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:10:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3282 transitions. [2019-01-13 22:10:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:10:03,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:03,056 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:03,057 INFO L423 AbstractCegarLoop]: === Iteration 11 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:03,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1576359516, now seen corresponding path program 1 times [2019-01-13 22:10:03,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:03,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:03,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:03,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:10:03,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:10:03,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:10:03,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:10:03,269 INFO L87 Difference]: Start difference. First operand 2155 states and 3282 transitions. Second operand 7 states. [2019-01-13 22:10:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:04,187 INFO L93 Difference]: Finished difference Result 981 states and 1243 transitions. [2019-01-13 22:10:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 22:10:04,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-01-13 22:10:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:04,194 INFO L225 Difference]: With dead ends: 981 [2019-01-13 22:10:04,195 INFO L226 Difference]: Without dead ends: 789 [2019-01-13 22:10:04,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:10:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-01-13 22:10:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 693. [2019-01-13 22:10:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-01-13 22:10:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 933 transitions. [2019-01-13 22:10:04,228 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 933 transitions. Word has length 29 [2019-01-13 22:10:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:04,228 INFO L480 AbstractCegarLoop]: Abstraction has 693 states and 933 transitions. [2019-01-13 22:10:04,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:10:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 933 transitions. [2019-01-13 22:10:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:10:04,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:04,230 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:04,231 INFO L423 AbstractCegarLoop]: === Iteration 12 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1161349097, now seen corresponding path program 1 times [2019-01-13 22:10:04,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:04,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:04,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:04,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:04,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:04,694 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-01-13 22:10:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:04,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:04,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-13 22:10:04,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:04,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:05,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:05,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-13 22:10:05,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 22:10:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 22:10:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:10:05,112 INFO L87 Difference]: Start difference. First operand 693 states and 933 transitions. Second operand 13 states. [2019-01-13 22:10:06,594 WARN L181 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-01-13 22:10:07,366 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-13 22:10:07,882 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 22:10:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:08,513 INFO L93 Difference]: Finished difference Result 1605 states and 2160 transitions. [2019-01-13 22:10:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-13 22:10:08,515 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-01-13 22:10:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:08,525 INFO L225 Difference]: With dead ends: 1605 [2019-01-13 22:10:08,525 INFO L226 Difference]: Without dead ends: 1605 [2019-01-13 22:10:08,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2019-01-13 22:10:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-01-13 22:10:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1217. [2019-01-13 22:10:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-01-13 22:10:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1626 transitions. [2019-01-13 22:10:08,581 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1626 transitions. Word has length 29 [2019-01-13 22:10:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:08,582 INFO L480 AbstractCegarLoop]: Abstraction has 1217 states and 1626 transitions. [2019-01-13 22:10:08,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 22:10:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1626 transitions. [2019-01-13 22:10:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 22:10:08,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:08,584 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:08,584 INFO L423 AbstractCegarLoop]: === Iteration 13 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:08,585 INFO L82 PathProgramCache]: Analyzing trace with hash 677753068, now seen corresponding path program 1 times [2019-01-13 22:10:08,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:08,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:08,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-13 22:10:08,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:08,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:10:08,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 22:10:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 22:10:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:10:08,769 INFO L87 Difference]: Start difference. First operand 1217 states and 1626 transitions. Second operand 4 states. [2019-01-13 22:10:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:08,867 INFO L93 Difference]: Finished difference Result 1225 states and 1638 transitions. [2019-01-13 22:10:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 22:10:08,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-13 22:10:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:08,876 INFO L225 Difference]: With dead ends: 1225 [2019-01-13 22:10:08,877 INFO L226 Difference]: Without dead ends: 1225 [2019-01-13 22:10:08,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:10:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-01-13 22:10:08,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1219. [2019-01-13 22:10:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2019-01-13 22:10:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1628 transitions. [2019-01-13 22:10:08,915 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1628 transitions. Word has length 35 [2019-01-13 22:10:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:08,915 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 1628 transitions. [2019-01-13 22:10:08,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 22:10:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1628 transitions. [2019-01-13 22:10:08,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 22:10:08,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:08,919 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:08,920 INFO L423 AbstractCegarLoop]: === Iteration 14 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:08,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:08,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2063956462, now seen corresponding path program 1 times [2019-01-13 22:10:08,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:08,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:08,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:08,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:09,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:09,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:10:09,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:09,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:09,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:09,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-01-13 22:10:09,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 22:10:09,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 22:10:09,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:10:09,719 INFO L87 Difference]: Start difference. First operand 1219 states and 1628 transitions. Second operand 10 states. [2019-01-13 22:10:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:11,050 INFO L93 Difference]: Finished difference Result 3187 states and 4273 transitions. [2019-01-13 22:10:11,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 22:10:11,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-13 22:10:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:11,072 INFO L225 Difference]: With dead ends: 3187 [2019-01-13 22:10:11,072 INFO L226 Difference]: Without dead ends: 3187 [2019-01-13 22:10:11,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-01-13 22:10:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2019-01-13 22:10:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 2923. [2019-01-13 22:10:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2019-01-13 22:10:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3907 transitions. [2019-01-13 22:10:11,162 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3907 transitions. Word has length 35 [2019-01-13 22:10:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:11,163 INFO L480 AbstractCegarLoop]: Abstraction has 2923 states and 3907 transitions. [2019-01-13 22:10:11,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 22:10:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3907 transitions. [2019-01-13 22:10:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 22:10:11,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:11,167 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:11,167 INFO L423 AbstractCegarLoop]: === Iteration 15 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:11,168 INFO L82 PathProgramCache]: Analyzing trace with hash -536484601, now seen corresponding path program 1 times [2019-01-13 22:10:11,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:11,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:11,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:11,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:10:11,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:11,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:10:11,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:11,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:11,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:11,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-01-13 22:10:11,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-13 22:10:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-13 22:10:11,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-01-13 22:10:11,560 INFO L87 Difference]: Start difference. First operand 2923 states and 3907 transitions. Second operand 14 states. [2019-01-13 22:10:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:12,624 INFO L93 Difference]: Finished difference Result 6155 states and 8933 transitions. [2019-01-13 22:10:12,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-13 22:10:12,626 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-01-13 22:10:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:12,667 INFO L225 Difference]: With dead ends: 6155 [2019-01-13 22:10:12,668 INFO L226 Difference]: Without dead ends: 6155 [2019-01-13 22:10:12,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2019-01-13 22:10:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2019-01-13 22:10:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 4073. [2019-01-13 22:10:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4073 states. [2019-01-13 22:10:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 5511 transitions. [2019-01-13 22:10:12,894 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 5511 transitions. Word has length 36 [2019-01-13 22:10:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:12,895 INFO L480 AbstractCegarLoop]: Abstraction has 4073 states and 5511 transitions. [2019-01-13 22:10:12,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-13 22:10:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 5511 transitions. [2019-01-13 22:10:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 22:10:12,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:12,902 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:12,904 INFO L423 AbstractCegarLoop]: === Iteration 16 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:12,905 INFO L82 PathProgramCache]: Analyzing trace with hash 968729960, now seen corresponding path program 1 times [2019-01-13 22:10:12,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:12,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:12,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:12,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:12,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-13 22:10:13,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:13,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:10:13,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:13,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-13 22:10:13,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:13,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-01-13 22:10:13,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-13 22:10:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-13 22:10:13,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-01-13 22:10:13,561 INFO L87 Difference]: Start difference. First operand 4073 states and 5511 transitions. Second operand 15 states. [2019-01-13 22:10:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:14,617 INFO L93 Difference]: Finished difference Result 6387 states and 8823 transitions. [2019-01-13 22:10:14,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-13 22:10:14,618 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-01-13 22:10:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:14,661 INFO L225 Difference]: With dead ends: 6387 [2019-01-13 22:10:14,661 INFO L226 Difference]: Without dead ends: 6203 [2019-01-13 22:10:14,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2019-01-13 22:10:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6203 states. [2019-01-13 22:10:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6203 to 5765. [2019-01-13 22:10:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-01-13 22:10:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7831 transitions. [2019-01-13 22:10:14,895 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7831 transitions. Word has length 47 [2019-01-13 22:10:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:14,896 INFO L480 AbstractCegarLoop]: Abstraction has 5765 states and 7831 transitions. [2019-01-13 22:10:14,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-13 22:10:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7831 transitions. [2019-01-13 22:10:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-13 22:10:14,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:14,898 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:14,899 INFO L423 AbstractCegarLoop]: === Iteration 17 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:14,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:14,899 INFO L82 PathProgramCache]: Analyzing trace with hash 612578211, now seen corresponding path program 1 times [2019-01-13 22:10:14,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:14,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:14,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:14,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:14,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-13 22:10:15,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:15,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:10:15,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:15,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-13 22:10:15,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:15,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-13 22:10:15,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:10:15,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:10:15,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:10:15,851 INFO L87 Difference]: Start difference. First operand 5765 states and 7831 transitions. Second operand 8 states. [2019-01-13 22:10:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:16,224 INFO L93 Difference]: Finished difference Result 10803 states and 16256 transitions. [2019-01-13 22:10:16,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 22:10:16,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-01-13 22:10:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:16,313 INFO L225 Difference]: With dead ends: 10803 [2019-01-13 22:10:16,313 INFO L226 Difference]: Without dead ends: 10743 [2019-01-13 22:10:16,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:10:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10743 states. [2019-01-13 22:10:16,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10743 to 7975. [2019-01-13 22:10:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7975 states. [2019-01-13 22:10:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7975 states to 7975 states and 10873 transitions. [2019-01-13 22:10:16,594 INFO L78 Accepts]: Start accepts. Automaton has 7975 states and 10873 transitions. Word has length 49 [2019-01-13 22:10:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:16,594 INFO L480 AbstractCegarLoop]: Abstraction has 7975 states and 10873 transitions. [2019-01-13 22:10:16,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:10:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 7975 states and 10873 transitions. [2019-01-13 22:10:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 22:10:16,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:16,601 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:16,601 INFO L423 AbstractCegarLoop]: === Iteration 18 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:16,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:16,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1699608922, now seen corresponding path program 2 times [2019-01-13 22:10:16,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:16,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:16,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:16,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:16,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-13 22:10:17,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:17,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:10:17,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:10:17,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 22:10:17,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:10:17,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-13 22:10:17,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:17,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-01-13 22:10:17,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 22:10:17,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 22:10:17,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:10:17,419 INFO L87 Difference]: Start difference. First operand 7975 states and 10873 transitions. Second operand 10 states. [2019-01-13 22:10:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:17,970 INFO L93 Difference]: Finished difference Result 6186 states and 9258 transitions. [2019-01-13 22:10:17,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 22:10:17,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-01-13 22:10:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:17,995 INFO L225 Difference]: With dead ends: 6186 [2019-01-13 22:10:17,995 INFO L226 Difference]: Without dead ends: 6128 [2019-01-13 22:10:17,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-13 22:10:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6128 states. [2019-01-13 22:10:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6128 to 3615. [2019-01-13 22:10:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3615 states. [2019-01-13 22:10:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 4812 transitions. [2019-01-13 22:10:18,127 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 4812 transitions. Word has length 54 [2019-01-13 22:10:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:18,127 INFO L480 AbstractCegarLoop]: Abstraction has 3615 states and 4812 transitions. [2019-01-13 22:10:18,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 22:10:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4812 transitions. [2019-01-13 22:10:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 22:10:18,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:18,131 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:18,132 INFO L423 AbstractCegarLoop]: === Iteration 19 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:18,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1180834517, now seen corresponding path program 1 times [2019-01-13 22:10:18,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:18,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:18,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:10:18,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-13 22:10:18,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:18,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:10:18,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:18,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-13 22:10:18,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:18,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-01-13 22:10:18,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 22:10:18,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 22:10:18,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-13 22:10:18,630 INFO L87 Difference]: Start difference. First operand 3615 states and 4812 transitions. Second operand 11 states. [2019-01-13 22:10:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:19,061 INFO L93 Difference]: Finished difference Result 4340 states and 5900 transitions. [2019-01-13 22:10:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 22:10:19,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-01-13 22:10:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:19,075 INFO L225 Difference]: With dead ends: 4340 [2019-01-13 22:10:19,076 INFO L226 Difference]: Without dead ends: 4340 [2019-01-13 22:10:19,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-01-13 22:10:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2019-01-13 22:10:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 4279. [2019-01-13 22:10:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4279 states. [2019-01-13 22:10:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 4279 states and 5839 transitions. [2019-01-13 22:10:19,185 INFO L78 Accepts]: Start accepts. Automaton has 4279 states and 5839 transitions. Word has length 60 [2019-01-13 22:10:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:19,186 INFO L480 AbstractCegarLoop]: Abstraction has 4279 states and 5839 transitions. [2019-01-13 22:10:19,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 22:10:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 5839 transitions. [2019-01-13 22:10:19,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-13 22:10:19,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:19,191 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:19,191 INFO L423 AbstractCegarLoop]: === Iteration 20 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:19,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:19,193 INFO L82 PathProgramCache]: Analyzing trace with hash -367947978, now seen corresponding path program 1 times [2019-01-13 22:10:19,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:19,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:19,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:19,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:19,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:19,445 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-13 22:10:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-13 22:10:19,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:19,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:10:19,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:19,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-13 22:10:19,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:19,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2019-01-13 22:10:19,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-13 22:10:19,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-13 22:10:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-01-13 22:10:19,864 INFO L87 Difference]: Start difference. First operand 4279 states and 5839 transitions. Second operand 18 states. [2019-01-13 22:10:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:21,617 INFO L93 Difference]: Finished difference Result 7541 states and 10489 transitions. [2019-01-13 22:10:21,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-13 22:10:21,618 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2019-01-13 22:10:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:21,642 INFO L225 Difference]: With dead ends: 7541 [2019-01-13 22:10:21,642 INFO L226 Difference]: Without dead ends: 7394 [2019-01-13 22:10:21,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2019-01-13 22:10:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7394 states. [2019-01-13 22:10:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7394 to 5738. [2019-01-13 22:10:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5738 states. [2019-01-13 22:10:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5738 states to 5738 states and 7612 transitions. [2019-01-13 22:10:21,828 INFO L78 Accepts]: Start accepts. Automaton has 5738 states and 7612 transitions. Word has length 62 [2019-01-13 22:10:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:21,829 INFO L480 AbstractCegarLoop]: Abstraction has 5738 states and 7612 transitions. [2019-01-13 22:10:21,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-13 22:10:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 5738 states and 7612 transitions. [2019-01-13 22:10:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-13 22:10:21,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:21,835 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:21,835 INFO L423 AbstractCegarLoop]: === Iteration 21 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:21,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:21,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1928299305, now seen corresponding path program 1 times [2019-01-13 22:10:21,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:21,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:21,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:21,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:21,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-01-13 22:10:22,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:22,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:10:22,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:22,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-01-13 22:10:22,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:22,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-01-13 22:10:22,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 22:10:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 22:10:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-13 22:10:22,396 INFO L87 Difference]: Start difference. First operand 5738 states and 7612 transitions. Second operand 11 states. [2019-01-13 22:10:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:22,960 INFO L93 Difference]: Finished difference Result 7225 states and 10130 transitions. [2019-01-13 22:10:22,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 22:10:22,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-01-13 22:10:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:22,985 INFO L225 Difference]: With dead ends: 7225 [2019-01-13 22:10:22,985 INFO L226 Difference]: Without dead ends: 7209 [2019-01-13 22:10:22,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-01-13 22:10:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7209 states. [2019-01-13 22:10:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7209 to 5553. [2019-01-13 22:10:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5553 states. [2019-01-13 22:10:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 7334 transitions. [2019-01-13 22:10:23,210 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 7334 transitions. Word has length 75 [2019-01-13 22:10:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:23,212 INFO L480 AbstractCegarLoop]: Abstraction has 5553 states and 7334 transitions. [2019-01-13 22:10:23,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 22:10:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 7334 transitions. [2019-01-13 22:10:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 22:10:23,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:23,218 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:23,218 INFO L423 AbstractCegarLoop]: === Iteration 22 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:23,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:23,219 INFO L82 PathProgramCache]: Analyzing trace with hash -89276347, now seen corresponding path program 1 times [2019-01-13 22:10:23,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:23,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:23,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:23,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:23,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 18 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-13 22:10:24,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:24,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:10:24,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:24,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 95 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-13 22:10:25,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:25,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-01-13 22:10:25,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 22:10:25,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 22:10:25,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-13 22:10:25,005 INFO L87 Difference]: Start difference. First operand 5553 states and 7334 transitions. Second operand 11 states. [2019-01-13 22:10:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:26,035 INFO L93 Difference]: Finished difference Result 6839 states and 9283 transitions. [2019-01-13 22:10:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 22:10:26,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2019-01-13 22:10:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:26,054 INFO L225 Difference]: With dead ends: 6839 [2019-01-13 22:10:26,055 INFO L226 Difference]: Without dead ends: 6839 [2019-01-13 22:10:26,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-01-13 22:10:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6839 states. [2019-01-13 22:10:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6839 to 6217. [2019-01-13 22:10:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2019-01-13 22:10:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 8353 transitions. [2019-01-13 22:10:26,234 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 8353 transitions. Word has length 76 [2019-01-13 22:10:26,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:26,236 INFO L480 AbstractCegarLoop]: Abstraction has 6217 states and 8353 transitions. [2019-01-13 22:10:26,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 22:10:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 8353 transitions. [2019-01-13 22:10:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-13 22:10:26,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:26,245 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:26,246 INFO L423 AbstractCegarLoop]: === Iteration 23 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1116491001, now seen corresponding path program 1 times [2019-01-13 22:10:26,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:26,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:26,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:26,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:26,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:26,508 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-13 22:10:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-13 22:10:26,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:26,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:10:26,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:26,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 90 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-13 22:10:26,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:26,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-01-13 22:10:26,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-13 22:10:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-13 22:10:26,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-01-13 22:10:26,935 INFO L87 Difference]: Start difference. First operand 6217 states and 8353 transitions. Second operand 18 states. [2019-01-13 22:10:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:28,604 INFO L93 Difference]: Finished difference Result 8549 states and 11539 transitions. [2019-01-13 22:10:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-13 22:10:28,606 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-01-13 22:10:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:28,627 INFO L225 Difference]: With dead ends: 8549 [2019-01-13 22:10:28,627 INFO L226 Difference]: Without dead ends: 8549 [2019-01-13 22:10:28,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2019-01-13 22:10:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8549 states. [2019-01-13 22:10:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8549 to 8286. [2019-01-13 22:10:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8286 states. [2019-01-13 22:10:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8286 states to 8286 states and 11294 transitions. [2019-01-13 22:10:28,823 INFO L78 Accepts]: Start accepts. Automaton has 8286 states and 11294 transitions. Word has length 78 [2019-01-13 22:10:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:28,823 INFO L480 AbstractCegarLoop]: Abstraction has 8286 states and 11294 transitions. [2019-01-13 22:10:28,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-13 22:10:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 8286 states and 11294 transitions. [2019-01-13 22:10:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 22:10:28,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:28,833 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:28,833 INFO L423 AbstractCegarLoop]: === Iteration 24 === [popErr2REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION]=== [2019-01-13 22:10:28,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1205797459, now seen corresponding path program 1 times [2019-01-13 22:10:28,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:28,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:28,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:28,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:28,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:10:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:10:28,943 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 22:10:29,022 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 22:10:29,047 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:10:29,048 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:10:29,055 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:10:29,062 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:10:29,067 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:10:29,072 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:10:29,082 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:10:29,085 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:10:29,088 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:10:29,089 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:10:29,092 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:10:29,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:10:29 BoogieIcfgContainer [2019-01-13 22:10:29,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:10:29,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:10:29,112 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:10:29,112 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:10:29,112 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:09:56" (3/4) ... [2019-01-13 22:10:29,120 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 22:10:29,121 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:10:29,122 INFO L168 Benchmark]: Toolchain (without parser) took 34918.37 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 515.9 MB). Free memory was 947.3 MB in the beginning and 964.7 MB in the end (delta: -17.3 MB). Peak memory consumption was 498.6 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:29,125 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:10:29,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:29,131 INFO L168 Benchmark]: Boogie Preprocessor took 78.34 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. [2019-01-13 22:10:29,134 INFO L168 Benchmark]: RCFGBuilder took 1093.98 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:29,136 INFO L168 Benchmark]: TraceAbstraction took 33048.78 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 964.7 MB in the end (delta: 107.6 MB). Peak memory consumption was 473.5 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:29,137 INFO L168 Benchmark]: Witness Printer took 9.88 ms. Allocated memory is still 1.5 GB. Free memory is still 964.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:10:29,150 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 682.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.34 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 1093.98 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33048.78 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 964.7 MB in the end (delta: 107.6 MB). Peak memory consumption was 473.5 MB. Max. memory is 11.5 GB. * Witness Printer took 9.88 ms. Allocated memory is still 1.5 GB. Free memory is still 964.7 MB. 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible FailurePath: [L624] struct cell *S; [L625] int pc1 = 1; [L626] int pc4 = 1; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=18, \old(garbage)=22, \old(pc1)=13, \old(pc4)=23, \old(res4)=14, \old(S)=15, \old(S)=10, \old(t1)=30, \old(t1)=21, \old(t4)=11, \old(t4)=16, \old(x1)=20, \old(x1)=24, \old(x4)=29, \old(x4)=28, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={-1:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L634] x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={-1:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L635] x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={-1:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L638] x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L641] t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L644] x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: [L652] case 6: [L653] pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 74 locations, 20 error locations. UNSAFE Result, 32.9s OverallTime, 24 OverallIterations, 7 TraceHistogramMax, 18.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2199 SDtfs, 4970 SDslu, 4503 SDs, 0 SdLazy, 5872 SolverSat, 1131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1055 GetRequests, 710 SyntacticMatches, 15 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8286occurred in iteration=23, 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: 2.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 13385 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1416 ConstructedInterpolants, 0 QuantifiedInterpolants, 176540 SizeOfPredicates, 56 NumberOfNonLiveVariables, 5645 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 36 InterpolantComputations, 11 PerfectInterpolantSequences, 1265/1484 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.24-0ed9222-m [2019-01-13 22:10:31,531 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:10:31,533 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:10:31,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:10:31,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:10:31,552 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:10:31,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:10:31,555 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:10:31,558 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:10:31,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:10:31,564 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:10:31,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:10:31,566 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:10:31,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:10:31,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:10:31,578 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:10:31,579 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:10:31,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:10:31,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:10:31,585 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:10:31,586 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:10:31,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:10:31,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:10:31,590 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:10:31,590 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:10:31,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:10:31,593 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:10:31,594 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:10:31,594 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:10:31,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:10:31,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:10:31,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:10:31,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:10:31,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:10:31,599 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:10:31,599 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:10:31,600 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-13 22:10:31,622 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:10:31,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:10:31,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:10:31,624 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:10:31,624 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:10:31,624 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:10:31,624 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:10:31,624 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:10:31,625 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:10:31,626 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:10:31,626 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:10:31,626 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:10:31,626 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:10:31,626 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:10:31,626 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:10:31,627 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-13 22:10:31,628 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-13 22:10:31,628 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:10:31,628 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:10:31,628 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:10:31,628 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:10:31,628 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:10:31,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:10:31,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:10:31,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:10:31,629 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:10:31,629 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-13 22:10:31,630 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:10:31,631 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-13 22:10:31,631 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 1cf39fe39780d3a80771c5bc79874b49e3ac2315 [2019-01-13 22:10:31,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:10:31,709 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:10:31,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:10:31,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:10:31,717 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:10:31,718 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/lockfree-3.1_false-valid-memtrack.i [2019-01-13 22:10:31,771 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60ae2bcb/64ccd95b99d04b18b8073be7f9f9984e/FLAGeb24a9a12 [2019-01-13 22:10:32,266 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:10:32,268 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/lockfree-3.1_false-valid-memtrack.i [2019-01-13 22:10:32,280 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60ae2bcb/64ccd95b99d04b18b8073be7f9f9984e/FLAGeb24a9a12 [2019-01-13 22:10:32,587 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60ae2bcb/64ccd95b99d04b18b8073be7f9f9984e [2019-01-13 22:10:32,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:10:32,593 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:10:32,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:10:32,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:10:32,598 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:10:32,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:10:32" (1/1) ... [2019-01-13 22:10:32,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5329403d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:32, skipping insertion in model container [2019-01-13 22:10:32,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:10:32" (1/1) ... [2019-01-13 22:10:32,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:10:32,661 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:10:33,037 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:10:33,053 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:10:33,212 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:10:33,273 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:10:33,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:33 WrapperNode [2019-01-13 22:10:33,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:10:33,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:10:33,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:10:33,275 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:10:33,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:33" (1/1) ... [2019-01-13 22:10:33,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:33" (1/1) ... [2019-01-13 22:10:33,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:33" (1/1) ... [2019-01-13 22:10:33,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:33" (1/1) ... [2019-01-13 22:10:33,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:33" (1/1) ... [2019-01-13 22:10:33,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:33" (1/1) ... [2019-01-13 22:10:33,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:33" (1/1) ... [2019-01-13 22:10:33,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:10:33,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:10:33,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:10:33,348 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:10:33,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-13 22:10:33,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:10:33,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:10:33,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:10:33,408 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2019-01-13 22:10:33,408 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2019-01-13 22:10:33,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:10:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 22:10:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:10:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:10:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:10:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:10:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:10:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:10:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:10:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:10:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:10:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:10:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:10:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:10:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:10:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:10:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:10:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:10:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:10:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:10:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:10:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:10:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:10:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:10:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:10:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:10:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:10:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:10:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:10:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:10:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:10:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:10:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:10:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:10:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:10:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:10:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:10:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:10:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:10:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:10:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:10:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:10:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:10:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:10:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:10:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:10:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:10:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:10:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:10:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:10:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:10:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:10:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:10:33,418 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:10:33,418 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:10:33,418 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:10:33,418 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:10:33,418 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:10:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:10:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:10:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:10:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:10:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:10:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:10:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:10:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:10:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 22:10:33,420 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:10:33,421 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:10:33,421 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:10:33,421 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:10:33,421 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:10:33,421 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:10:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:10:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:10:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:10:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:10:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:10:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:10:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:10:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:10:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:10:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:10:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:10:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:10:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:10:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:10:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:10:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:10:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:10:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:10:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:10:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:10:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:10:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:10:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:10:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:10:33,427 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:10:33,427 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:10:33,427 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:10:33,427 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:10:33,427 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:10:33,427 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:10:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:10:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure push [2019-01-13 22:10:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:10:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-13 22:10:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:10:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2019-01-13 22:10:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:10:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-13 22:10:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:10:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:10:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:10:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:10:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:10:34,382 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:10:34,382 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 22:10:34,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:10:34 BoogieIcfgContainer [2019-01-13 22:10:34,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:10:34,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:10:34,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:10:34,389 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:10:34,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:10:32" (1/3) ... [2019-01-13 22:10:34,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b4ce4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:10:34, skipping insertion in model container [2019-01-13 22:10:34,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:33" (2/3) ... [2019-01-13 22:10:34,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b4ce4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:10:34, skipping insertion in model container [2019-01-13 22:10:34,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:10:34" (3/3) ... [2019-01-13 22:10:34,394 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2019-01-13 22:10:34,403 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:10:34,410 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-13 22:10:34,426 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-13 22:10:34,449 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:10:34,450 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:10:34,450 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:10:34,450 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:10:34,450 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:10:34,451 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:10:34,451 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:10:34,451 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:10:34,451 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:10:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2019-01-13 22:10:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-13 22:10:34,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:34,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:34,479 INFO L423 AbstractCegarLoop]: === Iteration 1 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:34,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:34,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1065245696, now seen corresponding path program 1 times [2019-01-13 22:10:34,490 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:34,490 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:34,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:34,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:34,665 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:34,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:34,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:34,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-13 22:10:34,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-13 22:10:34,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 22:10:34,695 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 2 states. [2019-01-13 22:10:34,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:34,724 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-01-13 22:10:34,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-13 22:10:34,726 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-13 22:10:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:34,740 INFO L225 Difference]: With dead ends: 72 [2019-01-13 22:10:34,741 INFO L226 Difference]: Without dead ends: 69 [2019-01-13 22:10:34,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 22:10:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-13 22:10:34,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-13 22:10:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-13 22:10:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-01-13 22:10:34,784 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 8 [2019-01-13 22:10:34,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:34,784 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-01-13 22:10:34,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-13 22:10:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-01-13 22:10:34,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-13 22:10:34,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:34,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:34,785 INFO L423 AbstractCegarLoop]: === Iteration 2 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:34,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:34,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1065234164, now seen corresponding path program 1 times [2019-01-13 22:10:34,786 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:34,786 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:34,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:34,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:34,905 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:34,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:34,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:10:34,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:34,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:34,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:34,910 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2019-01-13 22:10:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:35,011 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2019-01-13 22:10:35,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:35,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-13 22:10:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:35,015 INFO L225 Difference]: With dead ends: 120 [2019-01-13 22:10:35,016 INFO L226 Difference]: Without dead ends: 120 [2019-01-13 22:10:35,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:35,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-13 22:10:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2019-01-13 22:10:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-13 22:10:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2019-01-13 22:10:35,034 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 8 [2019-01-13 22:10:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:35,035 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2019-01-13 22:10:35,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:35,035 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2019-01-13 22:10:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:10:35,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:35,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:35,037 INFO L423 AbstractCegarLoop]: === Iteration 3 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:35,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:35,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1337480689, now seen corresponding path program 1 times [2019-01-13 22:10:35,037 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:35,038 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:35,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:35,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:35,159 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:35,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:35,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:35,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:35,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:35,165 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand 3 states. [2019-01-13 22:10:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:35,461 INFO L93 Difference]: Finished difference Result 128 states and 182 transitions. [2019-01-13 22:10:35,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:35,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-13 22:10:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:35,466 INFO L225 Difference]: With dead ends: 128 [2019-01-13 22:10:35,466 INFO L226 Difference]: Without dead ends: 125 [2019-01-13 22:10:35,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-13 22:10:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2019-01-13 22:10:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-13 22:10:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-01-13 22:10:35,485 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 9 [2019-01-13 22:10:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:35,486 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-01-13 22:10:35,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-01-13 22:10:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:10:35,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:35,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:35,488 INFO L423 AbstractCegarLoop]: === Iteration 4 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:35,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1079345167, now seen corresponding path program 1 times [2019-01-13 22:10:35,489 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:35,489 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:35,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:35,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:35,722 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 [2019-01-13 22:10:35,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:10:35,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:10:35,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 22:10:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:35,792 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:35,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:35,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:35,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:35,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:35,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:35,798 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 3 states. [2019-01-13 22:10:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:36,193 INFO L93 Difference]: Finished difference Result 198 states and 290 transitions. [2019-01-13 22:10:36,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:36,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 22:10:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:36,201 INFO L225 Difference]: With dead ends: 198 [2019-01-13 22:10:36,201 INFO L226 Difference]: Without dead ends: 198 [2019-01-13 22:10:36,201 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 [2019-01-13 22:10:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-13 22:10:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 177. [2019-01-13 22:10:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-13 22:10:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 276 transitions. [2019-01-13 22:10:36,231 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 276 transitions. Word has length 11 [2019-01-13 22:10:36,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:36,231 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 276 transitions. [2019-01-13 22:10:36,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 276 transitions. [2019-01-13 22:10:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:10:36,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:36,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:36,232 INFO L423 AbstractCegarLoop]: === Iteration 5 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:36,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:36,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1079345166, now seen corresponding path program 1 times [2019-01-13 22:10:36,235 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:36,235 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:36,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:36,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:36,381 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 [2019-01-13 22:10:36,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:10:36,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:10:36,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:10:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:36,421 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:36,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:36,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:36,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:36,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:36,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:36,425 INFO L87 Difference]: Start difference. First operand 177 states and 276 transitions. Second operand 3 states. [2019-01-13 22:10:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:36,695 INFO L93 Difference]: Finished difference Result 249 states and 373 transitions. [2019-01-13 22:10:36,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:36,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 22:10:36,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:36,699 INFO L225 Difference]: With dead ends: 249 [2019-01-13 22:10:36,699 INFO L226 Difference]: Without dead ends: 249 [2019-01-13 22:10:36,700 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 [2019-01-13 22:10:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-13 22:10:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2019-01-13 22:10:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-13 22:10:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 360 transitions. [2019-01-13 22:10:36,722 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 360 transitions. Word has length 11 [2019-01-13 22:10:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:36,722 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 360 transitions. [2019-01-13 22:10:36,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 360 transitions. [2019-01-13 22:10:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 22:10:36,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:36,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:36,725 INFO L423 AbstractCegarLoop]: === Iteration 6 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:36,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:36,725 INFO L82 PathProgramCache]: Analyzing trace with hash 900045188, now seen corresponding path program 1 times [2019-01-13 22:10:36,726 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:36,726 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:36,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:36,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:36,936 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:36,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:36,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:10:36,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 22:10:36,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 22:10:36,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:10:36,942 INFO L87 Difference]: Start difference. First operand 231 states and 360 transitions. Second operand 4 states. [2019-01-13 22:10:37,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:37,200 INFO L93 Difference]: Finished difference Result 197 states and 283 transitions. [2019-01-13 22:10:37,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:10:37,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-13 22:10:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:37,204 INFO L225 Difference]: With dead ends: 197 [2019-01-13 22:10:37,204 INFO L226 Difference]: Without dead ends: 197 [2019-01-13 22:10:37,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:10:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-13 22:10:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 181. [2019-01-13 22:10:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-13 22:10:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2019-01-13 22:10:37,221 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 12 [2019-01-13 22:10:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:37,223 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2019-01-13 22:10:37,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 22:10:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2019-01-13 22:10:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 22:10:37,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:37,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:37,225 INFO L423 AbstractCegarLoop]: === Iteration 7 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:37,227 INFO L82 PathProgramCache]: Analyzing trace with hash 600119434, now seen corresponding path program 1 times [2019-01-13 22:10:37,227 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:37,227 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:37,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:37,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:37,455 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:37,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:37,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:10:37,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 22:10:37,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 22:10:37,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:10:37,460 INFO L87 Difference]: Start difference. First operand 181 states and 271 transitions. Second operand 4 states. [2019-01-13 22:10:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:37,520 INFO L93 Difference]: Finished difference Result 281 states and 404 transitions. [2019-01-13 22:10:37,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:10:37,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-01-13 22:10:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:37,524 INFO L225 Difference]: With dead ends: 281 [2019-01-13 22:10:37,524 INFO L226 Difference]: Without dead ends: 281 [2019-01-13 22:10:37,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:10:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-13 22:10:37,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2019-01-13 22:10:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-13 22:10:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 404 transitions. [2019-01-13 22:10:37,543 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 404 transitions. Word has length 13 [2019-01-13 22:10:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:37,544 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 404 transitions. [2019-01-13 22:10:37,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 22:10:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 404 transitions. [2019-01-13 22:10:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 22:10:37,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:37,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:37,547 INFO L423 AbstractCegarLoop]: === Iteration 8 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1959085003, now seen corresponding path program 1 times [2019-01-13 22:10:37,548 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:37,548 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:37,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:37,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:37,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:10:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:37,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:37,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-13 22:10:37,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 22:10:37,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 22:10:37,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:10:37,948 INFO L87 Difference]: Start difference. First operand 281 states and 404 transitions. Second operand 10 states. [2019-01-13 22:10:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:39,431 INFO L93 Difference]: Finished difference Result 690 states and 1010 transitions. [2019-01-13 22:10:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 22:10:39,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-13 22:10:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:39,437 INFO L225 Difference]: With dead ends: 690 [2019-01-13 22:10:39,437 INFO L226 Difference]: Without dead ends: 690 [2019-01-13 22:10:39,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-13 22:10:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-01-13 22:10:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 587. [2019-01-13 22:10:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-01-13 22:10:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 865 transitions. [2019-01-13 22:10:39,473 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 865 transitions. Word has length 18 [2019-01-13 22:10:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:39,474 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 865 transitions. [2019-01-13 22:10:39,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 22:10:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 865 transitions. [2019-01-13 22:10:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 22:10:39,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:39,475 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:39,475 INFO L423 AbstractCegarLoop]: === Iteration 9 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:39,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash -283009986, now seen corresponding path program 1 times [2019-01-13 22:10:39,478 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:39,478 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:39,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:39,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:39,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:10:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:39,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:39,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-01-13 22:10:39,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 22:10:39,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 22:10:39,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:10:39,928 INFO L87 Difference]: Start difference. First operand 587 states and 865 transitions. Second operand 10 states. [2019-01-13 22:10:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:41,302 INFO L93 Difference]: Finished difference Result 909 states and 1312 transitions. [2019-01-13 22:10:41,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 22:10:41,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-13 22:10:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:41,312 INFO L225 Difference]: With dead ends: 909 [2019-01-13 22:10:41,312 INFO L226 Difference]: Without dead ends: 909 [2019-01-13 22:10:41,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-01-13 22:10:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-01-13 22:10:41,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 837. [2019-01-13 22:10:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-01-13 22:10:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1189 transitions. [2019-01-13 22:10:41,350 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1189 transitions. Word has length 20 [2019-01-13 22:10:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:41,351 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1189 transitions. [2019-01-13 22:10:41,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 22:10:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1189 transitions. [2019-01-13 22:10:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:10:41,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:41,354 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:41,354 INFO L423 AbstractCegarLoop]: === Iteration 10 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:41,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash 680478218, now seen corresponding path program 2 times [2019-01-13 22:10:41,355 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:41,356 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:41,385 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-13 22:10:41,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 22:10:41,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:10:41,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:10:41,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:10:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:42,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:42,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-01-13 22:10:42,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-13 22:10:42,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-13 22:10:42,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-01-13 22:10:42,010 INFO L87 Difference]: Start difference. First operand 837 states and 1189 transitions. Second operand 14 states. [2019-01-13 22:10:42,206 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-13 22:10:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:44,613 INFO L93 Difference]: Finished difference Result 1731 states and 2575 transitions. [2019-01-13 22:10:44,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-13 22:10:44,616 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-13 22:10:44,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:44,626 INFO L225 Difference]: With dead ends: 1731 [2019-01-13 22:10:44,626 INFO L226 Difference]: Without dead ends: 1707 [2019-01-13 22:10:44,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2019-01-13 22:10:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-01-13 22:10:44,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1635. [2019-01-13 22:10:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-01-13 22:10:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2443 transitions. [2019-01-13 22:10:44,688 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2443 transitions. Word has length 27 [2019-01-13 22:10:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:44,688 INFO L480 AbstractCegarLoop]: Abstraction has 1635 states and 2443 transitions. [2019-01-13 22:10:44,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-13 22:10:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2443 transitions. [2019-01-13 22:10:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:10:44,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:44,691 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:44,692 INFO L423 AbstractCegarLoop]: === Iteration 11 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:44,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1294712752, now seen corresponding path program 1 times [2019-01-13 22:10:44,692 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:44,692 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:44,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:10:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:44,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:45,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:10:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:45,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:45,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-01-13 22:10:45,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 22:10:45,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 22:10:45,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-13 22:10:45,301 INFO L87 Difference]: Start difference. First operand 1635 states and 2443 transitions. Second operand 12 states. [2019-01-13 22:10:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:46,857 INFO L93 Difference]: Finished difference Result 2230 states and 3205 transitions. [2019-01-13 22:10:46,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 22:10:46,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-01-13 22:10:46,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:46,874 INFO L225 Difference]: With dead ends: 2230 [2019-01-13 22:10:46,875 INFO L226 Difference]: Without dead ends: 2230 [2019-01-13 22:10:46,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-01-13 22:10:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2019-01-13 22:10:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1893. [2019-01-13 22:10:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-01-13 22:10:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2782 transitions. [2019-01-13 22:10:46,953 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2782 transitions. Word has length 29 [2019-01-13 22:10:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:46,953 INFO L480 AbstractCegarLoop]: Abstraction has 1893 states and 2782 transitions. [2019-01-13 22:10:46,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 22:10:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2782 transitions. [2019-01-13 22:10:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 22:10:46,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:46,960 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:46,960 INFO L423 AbstractCegarLoop]: === Iteration 12 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:46,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:46,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1268297987, now seen corresponding path program 1 times [2019-01-13 22:10:46,961 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:46,961 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:46,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:47,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:10:47,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:10:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:47,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:47,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2019-01-13 22:10:47,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 22:10:47,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 22:10:47,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:10:47,495 INFO L87 Difference]: Start difference. First operand 1893 states and 2782 transitions. Second operand 13 states. [2019-01-13 22:10:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:49,334 INFO L93 Difference]: Finished difference Result 2171 states and 2956 transitions. [2019-01-13 22:10:49,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-13 22:10:49,335 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-01-13 22:10:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:49,346 INFO L225 Difference]: With dead ends: 2171 [2019-01-13 22:10:49,346 INFO L226 Difference]: Without dead ends: 1927 [2019-01-13 22:10:49,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2019-01-13 22:10:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2019-01-13 22:10:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1777. [2019-01-13 22:10:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1777 states. [2019-01-13 22:10:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2536 transitions. [2019-01-13 22:10:49,409 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2536 transitions. Word has length 30 [2019-01-13 22:10:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:49,409 INFO L480 AbstractCegarLoop]: Abstraction has 1777 states and 2536 transitions. [2019-01-13 22:10:49,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 22:10:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2536 transitions. [2019-01-13 22:10:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 22:10:49,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:49,414 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:49,414 INFO L423 AbstractCegarLoop]: === Iteration 13 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1160438596, now seen corresponding path program 1 times [2019-01-13 22:10:49,417 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:49,417 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:49,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:49,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:50,653 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-13 22:10:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-13 22:10:50,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:10:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:51,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:51,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2019-01-13 22:10:51,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 22:10:51,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 22:10:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:10:51,250 INFO L87 Difference]: Start difference. First operand 1777 states and 2536 transitions. Second operand 16 states. [2019-01-13 22:10:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:53,299 INFO L93 Difference]: Finished difference Result 1997 states and 2646 transitions. [2019-01-13 22:10:53,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-13 22:10:53,301 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-01-13 22:10:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:53,311 INFO L225 Difference]: With dead ends: 1997 [2019-01-13 22:10:53,311 INFO L226 Difference]: Without dead ends: 1769 [2019-01-13 22:10:53,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=308, Invalid=1098, Unknown=0, NotChecked=0, Total=1406 [2019-01-13 22:10:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2019-01-13 22:10:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1677. [2019-01-13 22:10:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-01-13 22:10:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2322 transitions. [2019-01-13 22:10:53,365 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2322 transitions. Word has length 39 [2019-01-13 22:10:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:53,365 INFO L480 AbstractCegarLoop]: Abstraction has 1677 states and 2322 transitions. [2019-01-13 22:10:53,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 22:10:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2322 transitions. [2019-01-13 22:10:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 22:10:53,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:53,368 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:53,369 INFO L423 AbstractCegarLoop]: === Iteration 14 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:53,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2100406892, now seen corresponding path program 1 times [2019-01-13 22:10:53,371 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:53,371 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:53,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:53,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-13 22:10:53,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:10:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (15)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 22:10:54,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:54,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2019-01-13 22:10:54,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 22:10:54,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 22:10:54,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-01-13 22:10:54,033 INFO L87 Difference]: Start difference. First operand 1677 states and 2322 transitions. Second operand 20 states. [2019-01-13 22:10:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:57,456 INFO L93 Difference]: Finished difference Result 3331 states and 4824 transitions. [2019-01-13 22:10:57,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-13 22:10:57,457 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2019-01-13 22:10:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:57,476 INFO L225 Difference]: With dead ends: 3331 [2019-01-13 22:10:57,476 INFO L226 Difference]: Without dead ends: 3219 [2019-01-13 22:10:57,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=522, Invalid=1830, Unknown=0, NotChecked=0, Total=2352 [2019-01-13 22:10:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3219 states. [2019-01-13 22:10:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3219 to 2850. [2019-01-13 22:10:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2850 states. [2019-01-13 22:10:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 4196 transitions. [2019-01-13 22:10:57,577 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 4196 transitions. Word has length 45 [2019-01-13 22:10:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:57,577 INFO L480 AbstractCegarLoop]: Abstraction has 2850 states and 4196 transitions. [2019-01-13 22:10:57,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 22:10:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 4196 transitions. [2019-01-13 22:10:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 22:10:57,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:57,580 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:57,580 INFO L423 AbstractCegarLoop]: === Iteration 15 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:10:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash 569309663, now seen corresponding path program 1 times [2019-01-13 22:10:57,582 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:57,582 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:10:57,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:57,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-13 22:10:57,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:10:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:58,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:58,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 19 [2019-01-13 22:10:58,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-13 22:10:58,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-13 22:10:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-01-13 22:10:58,429 INFO L87 Difference]: Start difference. First operand 2850 states and 4196 transitions. Second operand 19 states. [2019-01-13 22:10:59,624 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2019-01-13 22:11:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:01,722 INFO L93 Difference]: Finished difference Result 3667 states and 5138 transitions. [2019-01-13 22:11:01,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-13 22:11:01,724 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2019-01-13 22:11:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:01,743 INFO L225 Difference]: With dead ends: 3667 [2019-01-13 22:11:01,744 INFO L226 Difference]: Without dead ends: 3431 [2019-01-13 22:11:01,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=398, Invalid=1494, Unknown=0, NotChecked=0, Total=1892 [2019-01-13 22:11:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2019-01-13 22:11:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3173. [2019-01-13 22:11:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3173 states. [2019-01-13 22:11:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 4630 transitions. [2019-01-13 22:11:01,838 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 4630 transitions. Word has length 48 [2019-01-13 22:11:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:01,839 INFO L480 AbstractCegarLoop]: Abstraction has 3173 states and 4630 transitions. [2019-01-13 22:11:01,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-13 22:11:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 4630 transitions. [2019-01-13 22:11:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 22:11:01,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:01,841 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:11:01,842 INFO L423 AbstractCegarLoop]: === Iteration 16 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:01,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:01,843 INFO L82 PathProgramCache]: Analyzing trace with hash -658157897, now seen corresponding path program 1 times [2019-01-13 22:11:01,843 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:01,843 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:11:01,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:01,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-13 22:11:02,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:11:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:11:02,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:11:02,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 24 [2019-01-13 22:11:02,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-13 22:11:02,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-13 22:11:02,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2019-01-13 22:11:02,699 INFO L87 Difference]: Start difference. First operand 3173 states and 4630 transitions. Second operand 24 states. [2019-01-13 22:11:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:07,185 INFO L93 Difference]: Finished difference Result 7356 states and 11076 transitions. [2019-01-13 22:11:07,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-13 22:11:07,186 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 54 [2019-01-13 22:11:07,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:07,231 INFO L225 Difference]: With dead ends: 7356 [2019-01-13 22:11:07,237 INFO L226 Difference]: Without dead ends: 7244 [2019-01-13 22:11:07,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=817, Invalid=2965, Unknown=0, NotChecked=0, Total=3782 [2019-01-13 22:11:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7244 states. [2019-01-13 22:11:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7244 to 6233. [2019-01-13 22:11:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6233 states. [2019-01-13 22:11:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 9328 transitions. [2019-01-13 22:11:07,504 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 9328 transitions. Word has length 54 [2019-01-13 22:11:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:07,504 INFO L480 AbstractCegarLoop]: Abstraction has 6233 states and 9328 transitions. [2019-01-13 22:11:07,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-13 22:11:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 9328 transitions. [2019-01-13 22:11:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-13 22:11:07,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:07,506 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:11:07,506 INFO L423 AbstractCegarLoop]: === Iteration 17 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:07,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1022319614, now seen corresponding path program 1 times [2019-01-13 22:11:07,510 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:07,511 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:11:07,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:07,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 48 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-13 22:11:07,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:11:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:11:08,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:11:08,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 22 [2019-01-13 22:11:08,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 22:11:08,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 22:11:08,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2019-01-13 22:11:08,406 INFO L87 Difference]: Start difference. First operand 6233 states and 9328 transitions. Second operand 22 states. [2019-01-13 22:11:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:12,314 INFO L93 Difference]: Finished difference Result 7144 states and 10378 transitions. [2019-01-13 22:11:12,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-13 22:11:12,315 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2019-01-13 22:11:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:12,360 INFO L225 Difference]: With dead ends: 7144 [2019-01-13 22:11:12,360 INFO L226 Difference]: Without dead ends: 7016 [2019-01-13 22:11:12,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=493, Invalid=1957, Unknown=0, NotChecked=0, Total=2450 [2019-01-13 22:11:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2019-01-13 22:11:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 6624. [2019-01-13 22:11:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6624 states. [2019-01-13 22:11:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6624 states to 6624 states and 9848 transitions. [2019-01-13 22:11:12,552 INFO L78 Accepts]: Start accepts. Automaton has 6624 states and 9848 transitions. Word has length 59 [2019-01-13 22:11:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:12,552 INFO L480 AbstractCegarLoop]: Abstraction has 6624 states and 9848 transitions. [2019-01-13 22:11:12,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 22:11:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 6624 states and 9848 transitions. [2019-01-13 22:11:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-13 22:11:12,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:12,556 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:11:12,557 INFO L423 AbstractCegarLoop]: === Iteration 18 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:12,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:12,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1790941162, now seen corresponding path program 1 times [2019-01-13 22:11:12,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:12,559 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:11:12,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:11:12,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:11:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 51 proven. 49 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-01-13 22:11:12,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:11:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:11:13,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:11:13,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2019-01-13 22:11:13,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-13 22:11:13,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-13 22:11:13,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-01-13 22:11:13,536 INFO L87 Difference]: Start difference. First operand 6624 states and 9848 transitions. Second operand 28 states. [2019-01-13 22:11:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:11:18,803 INFO L93 Difference]: Finished difference Result 14030 states and 21437 transitions. [2019-01-13 22:11:18,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-13 22:11:18,806 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2019-01-13 22:11:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:11:18,867 INFO L225 Difference]: With dead ends: 14030 [2019-01-13 22:11:18,867 INFO L226 Difference]: Without dead ends: 13800 [2019-01-13 22:11:18,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1192, Invalid=4358, Unknown=0, NotChecked=0, Total=5550 [2019-01-13 22:11:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13800 states. [2019-01-13 22:11:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13800 to 11729. [2019-01-13 22:11:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11729 states. [2019-01-13 22:11:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11729 states to 11729 states and 17748 transitions. [2019-01-13 22:11:19,343 INFO L78 Accepts]: Start accepts. Automaton has 11729 states and 17748 transitions. Word has length 69 [2019-01-13 22:11:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:11:19,343 INFO L480 AbstractCegarLoop]: Abstraction has 11729 states and 17748 transitions. [2019-01-13 22:11:19,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-13 22:11:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 11729 states and 17748 transitions. [2019-01-13 22:11:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 22:11:19,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:11:19,346 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:11:19,347 INFO L423 AbstractCegarLoop]: === Iteration 19 === [popErr0REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr0REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION]=== [2019-01-13 22:11:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:11:19,348 INFO L82 PathProgramCache]: Analyzing trace with hash 686817382, now seen corresponding path program 1 times [2019-01-13 22:11:19,348 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:11:19,348 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:11:19,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:11:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:11:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:11:20,205 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 22:11:20,304 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 22:11:20,316 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,317 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,317 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,318 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,318 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,318 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,318 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,318 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,320 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,320 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,320 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,321 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,324 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,324 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,324 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,324 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,325 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,325 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,325 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,325 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,326 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,327 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,328 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,328 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,330 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,330 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,330 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,331 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,331 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,331 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:11:20,331 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,333 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,333 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,334 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,334 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,334 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,334 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,337 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,337 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,337 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,337 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,337 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,339 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:11:20,339 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,339 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,340 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,340 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,341 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,341 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,341 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,343 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,343 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,344 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,344 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,344 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,344 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,344 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:11:20,346 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,347 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,347 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,347 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,348 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,348 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,349 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,349 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,349 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,349 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,349 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,351 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,352 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,352 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,352 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,353 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,353 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,353 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,354 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,354 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,355 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,357 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,357 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,357 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,357 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,358 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,359 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,359 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,359 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,359 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,360 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,360 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,361 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,362 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,363 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:11:20,363 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,363 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,363 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,364 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,365 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,365 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,365 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,366 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,368 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,368 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,368 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,369 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,370 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,370 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:11:20,370 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,370 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,370 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,371 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,371 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,371 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,371 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,374 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,375 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,375 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,375 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,376 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,376 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,376 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,376 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,376 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,377 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,379 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,379 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,380 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,381 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,381 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,381 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,381 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,381 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,382 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,382 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,382 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,382 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,383 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,385 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,386 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,386 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,386 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,387 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:11:20,387 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,387 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,387 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,388 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,388 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,388 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,388 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,388 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,389 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,392 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,392 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,392 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,393 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,393 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,393 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,393 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,393 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,394 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,394 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,394 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,394 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,395 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,395 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,395 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,395 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,396 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,399 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,399 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,399 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,400 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,400 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,400 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,400 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,402 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,403 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,403 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,403 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,403 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,405 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,405 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,405 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:11:20,405 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,406 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,406 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,406 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,406 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,408 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,409 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,409 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,409 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:11:20,409 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,410 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,410 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,410 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,410 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,410 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,411 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,411 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,411 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,411 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,414 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,414 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,415 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,415 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,415 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,415 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,416 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,416 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,416 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,418 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,418 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,419 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,419 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,419 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,420 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,421 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,421 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,421 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,422 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,422 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,422 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,422 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,423 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,425 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,425 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,426 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,426 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,426 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,426 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:11:20,426 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,427 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,427 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,427 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,427 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,427 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,427 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,431 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,431 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,431 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,431 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,431 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,432 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:11:20,432 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,432 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,432 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,432 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,433 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,433 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,433 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,433 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,434 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,437 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,437 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,437 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,437 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,438 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,438 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,438 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,438 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,438 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,439 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,441 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,442 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,442 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,443 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,443 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,443 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,443 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,443 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,443 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,444 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,444 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,444 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,444 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,447 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,447 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,447 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-01-13 22:11:20,448 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,448 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,448 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,448 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,448 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,448 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,449 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,449 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,449 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,449 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,450 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,453 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,453 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,453 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,453 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,453 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,453 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,454 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,454 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,454 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,454 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,455 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,457 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,457 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,457 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,458 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,459 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,459 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,459 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,459 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,460 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,460 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,460 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,460 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,464 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,464 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,464 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,464 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,464 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,465 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,465 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,465 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,465 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,465 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,465 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:11:20,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:11:20 BoogieIcfgContainer [2019-01-13 22:11:20,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:11:20,483 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:11:20,483 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:11:20,483 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:11:20,483 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:10:34" (3/4) ... [2019-01-13 22:11:20,490 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 22:11:20,490 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:11:20,491 INFO L168 Benchmark]: Toolchain (without parser) took 47899.72 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 463.5 MB). Free memory was 952.7 MB in the beginning and 811.8 MB in the end (delta: 140.9 MB). Peak memory consumption was 604.3 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:20,493 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:11:20,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:20,496 INFO L168 Benchmark]: Boogie Preprocessor took 72.40 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:20,497 INFO L168 Benchmark]: RCFGBuilder took 1036.40 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: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:20,498 INFO L168 Benchmark]: TraceAbstraction took 46097.58 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.5 MB). Free memory was 1.1 GB in the beginning and 811.8 MB in the end (delta: 247.3 MB). Peak memory consumption was 571.8 MB. Max. memory is 11.5 GB. [2019-01-13 22:11:20,499 INFO L168 Benchmark]: Witness Printer took 7.88 ms. Allocated memory is still 1.5 GB. Free memory is still 811.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:11:20,505 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 680.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.40 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1036.40 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: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46097.58 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.5 MB). Free memory was 1.1 GB in the beginning and 811.8 MB in the end (delta: 247.3 MB). Peak memory consumption was 571.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.88 ms. Allocated memory is still 1.5 GB. Free memory is still 811.8 MB. 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 1073741824bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible FailurePath: [L624] struct cell *S; [L625] int pc1 = 1; [L626] int pc4 = 1; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=0, \old(pc4)=0, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, malloc(sizeof(*x1))={1073741824:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L634] x1->data = 0 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, malloc(sizeof(*x1))={1073741824:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L635] x1->next = ((void *)0) VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, malloc(sizeof(*x1))={1073741824:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L638] x1->data = 4 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L641] t1 = S VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L644] x1->next = t1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] S = x1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={1073741824:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=1, res4=0, S={1073741824:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=1, res4=0, S={1073741824:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: [L652] case 6: [L653] pc1 = 1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={1073741824:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L692] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={1073741824:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={1073741824:0}, t1={0:0}, t4={0:0}, x1={1073741824:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 75 locations, 20 error locations. UNSAFE Result, 46.0s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 33.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2428 SDtfs, 11259 SDslu, 3672 SDs, 0 SdLazy, 10442 SolverSat, 2820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1226 GetRequests, 787 SyntacticMatches, 15 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11729occurred in iteration=18, 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: 1.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 5010 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 581 NumberOfCodeBlocks, 581 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 919 ConstructedInterpolants, 0 QuantifiedInterpolants, 208655 SizeOfPredicates, 74 NumberOfNonLiveVariables, 3837 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 29 InterpolantComputations, 7 PerfectInterpolantSequences, 350/958 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...