./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety/lockfree-3.2_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.2_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 1cdc9955d0f744a8bccc682f75e63a6c9ebbfe78 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2_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 1cdc9955d0f744a8bccc682f75e63a6c9ebbfe78 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:10:08,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:10:08,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:10:08,782 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:10:08,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:10:08,784 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:10:08,785 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:10:08,787 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:10:08,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:10:08,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:10:08,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:10:08,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:10:08,792 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:10:08,793 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:10:08,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:10:08,795 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:10:08,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:10:08,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:10:08,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:10:08,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:10:08,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:10:08,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:10:08,808 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:10:08,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:10:08,808 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:10:08,809 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:10:08,811 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:10:08,812 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:10:08,813 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:10:08,814 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:10:08,814 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:10:08,815 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:10:08,815 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:10:08,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:10:08,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:10:08,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:10:08,818 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:10:08,834 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:10:08,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:10:08,835 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:10:08,835 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:10:08,835 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:10:08,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:10:08,836 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:10:08,836 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:10:08,836 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:10:08,836 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:10:08,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:10:08,838 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:10:08,838 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:10:08,838 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:10:08,838 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:10:08,839 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:10:08,839 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:10:08,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:10:08,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:10:08,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:10:08,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:10:08,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:10:08,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:10:08,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:10:08,841 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:10:08,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:10:08,841 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 -> 1cdc9955d0f744a8bccc682f75e63a6c9ebbfe78 [2019-01-13 22:10:08,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:10:08,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:10:08,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:10:08,911 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:10:08,911 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:10:08,912 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/lockfree-3.2_false-valid-memtrack.i [2019-01-13 22:10:08,975 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a9957f4/af6320b071af4ee9bd066cebd74c4e13/FLAG28d5e0d47 [2019-01-13 22:10:09,456 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:10:09,457 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/lockfree-3.2_false-valid-memtrack.i [2019-01-13 22:10:09,479 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a9957f4/af6320b071af4ee9bd066cebd74c4e13/FLAG28d5e0d47 [2019-01-13 22:10:09,744 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a9957f4/af6320b071af4ee9bd066cebd74c4e13 [2019-01-13 22:10:09,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:10:09,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:10:09,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:10:09,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:10:09,754 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:10:09,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:10:09" (1/1) ... [2019-01-13 22:10:09,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a7d791d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:09, skipping insertion in model container [2019-01-13 22:10:09,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:10:09" (1/1) ... [2019-01-13 22:10:09,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:10:09,810 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:10:10,136 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:10:10,149 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:10:10,273 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:10:10,330 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:10:10,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:10 WrapperNode [2019-01-13 22:10:10,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:10:10,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:10:10,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:10:10,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:10:10,347 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:10" (1/1) ... [2019-01-13 22:10:10,348 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:10" (1/1) ... [2019-01-13 22:10:10,366 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:10" (1/1) ... [2019-01-13 22:10:10,367 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:10" (1/1) ... [2019-01-13 22:10:10,384 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:10" (1/1) ... [2019-01-13 22:10:10,390 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:10" (1/1) ... [2019-01-13 22:10:10,394 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:10" (1/1) ... [2019-01-13 22:10:10,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:10:10,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:10:10,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:10:10,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:10:10,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:10" (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:10,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:10:10,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:10:10,455 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2019-01-13 22:10:10,455 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2019-01-13 22:10:10,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:10:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 22:10:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:10:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:10:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:10:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:10:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:10:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:10:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:10:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:10:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:10:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:10:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:10:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:10:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:10:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:10:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:10:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:10:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:10:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:10:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:10:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:10:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:10:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:10:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:10:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:10:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:10:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:10:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:10:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:10:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:10:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:10:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:10:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:10:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:10:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:10:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:10:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:10:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:10:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:10:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:10:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:10:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:10:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:10:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:10:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:10:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:10:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:10:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:10:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:10:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:10:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:10:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:10:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:10:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:10:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:10:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:10:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:10:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:10:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:10:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:10:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:10:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:10:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:10:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:10:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:10:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 22:10:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:10:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:10:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:10:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:10:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:10:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:10:10,472 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:10:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:10:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:10:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:10:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:10:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:10:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:10:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:10:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:10:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:10:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:10:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:10:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:10:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:10:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:10:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:10:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:10:10,475 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:10:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:10:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:10:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:10:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:10:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:10:10,479 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:10:10,479 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:10:10,479 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:10:10,479 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:10:10,479 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:10:10,479 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:10:10,479 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:10:10,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:10:10,480 INFO L130 BoogieDeclarations]: Found specification of procedure push [2019-01-13 22:10:10,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:10:10,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 22:10:10,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:10:10,482 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2019-01-13 22:10:10,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:10:10,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 22:10:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:10:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:10:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:10:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:10:11,368 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:10:11,368 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 22:10:11,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:10:11 BoogieIcfgContainer [2019-01-13 22:10:11,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:10:11,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:10:11,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:10:11,377 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:10:11,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:10:09" (1/3) ... [2019-01-13 22:10:11,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a92608a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:10:11, skipping insertion in model container [2019-01-13 22:10:11,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:10" (2/3) ... [2019-01-13 22:10:11,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a92608a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:10:11, skipping insertion in model container [2019-01-13 22:10:11,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:10:11" (3/3) ... [2019-01-13 22:10:11,384 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.2_false-valid-memtrack.i [2019-01-13 22:10:11,395 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:10:11,405 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-13 22:10:11,425 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-13 22:10:11,452 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:10:11,453 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:10:11,453 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:10:11,453 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:10:11,454 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:10:11,454 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:10:11,455 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:10:11,455 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:10:11,455 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:10:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-01-13 22:10:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-13 22:10:11,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:11,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:11,488 INFO L423 AbstractCegarLoop]: === Iteration 1 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:11,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:11,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1052716832, now seen corresponding path program 1 times [2019-01-13 22:10:11,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:11,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:11,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:11,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:11,650 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:11,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:11,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:11,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-13 22:10:11,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-13 22:10:11,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 22:10:11,671 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2019-01-13 22:10:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:11,689 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2019-01-13 22:10:11,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-13 22:10:11,692 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-13 22:10:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:11,707 INFO L225 Difference]: With dead ends: 74 [2019-01-13 22:10:11,707 INFO L226 Difference]: Without dead ends: 71 [2019-01-13 22:10:11,709 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:10:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-13 22:10:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-13 22:10:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-13 22:10:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-01-13 22:10:11,759 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 8 [2019-01-13 22:10:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:11,760 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-01-13 22:10:11,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-13 22:10:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-01-13 22:10:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:10:11,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:11,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:11,763 INFO L423 AbstractCegarLoop]: === Iteration 2 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:11,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:11,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1931190033, now seen corresponding path program 1 times [2019-01-13 22:10:11,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:11,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:11,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:11,899 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:11,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:11,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:10:11,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:11,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:11,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:11,904 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 3 states. [2019-01-13 22:10:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:12,002 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2019-01-13 22:10:12,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:12,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:10:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:12,007 INFO L225 Difference]: With dead ends: 72 [2019-01-13 22:10:12,009 INFO L226 Difference]: Without dead ends: 72 [2019-01-13 22:10:12,010 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:10:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-13 22:10:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-13 22:10:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-13 22:10:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-01-13 22:10:12,033 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 10 [2019-01-13 22:10:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:12,033 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-01-13 22:10:12,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-01-13 22:10:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:10:12,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:12,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:12,038 INFO L423 AbstractCegarLoop]: === Iteration 3 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:12,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:12,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1931249615, now seen corresponding path program 1 times [2019-01-13 22:10:12,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:12,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:12,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:12,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:12,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:12,226 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:12,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:12,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:10:12,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:12,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:12,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:12,227 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 3 states. [2019-01-13 22:10:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:12,323 INFO L93 Difference]: Finished difference Result 126 states and 161 transitions. [2019-01-13 22:10:12,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:12,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:10:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:12,327 INFO L225 Difference]: With dead ends: 126 [2019-01-13 22:10:12,327 INFO L226 Difference]: Without dead ends: 126 [2019-01-13 22:10:12,328 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:10:12,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-13 22:10:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2019-01-13 22:10:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 22:10:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2019-01-13 22:10:12,347 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 10 [2019-01-13 22:10:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:12,349 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2019-01-13 22:10:12,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2019-01-13 22:10:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:10:12,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:12,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:12,350 INFO L423 AbstractCegarLoop]: === Iteration 4 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash -260805484, now seen corresponding path program 1 times [2019-01-13 22:10:12,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:12,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:12,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:12,437 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:12,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:12,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:12,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:12,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:12,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:12,439 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2019-01-13 22:10:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:12,572 INFO L93 Difference]: Finished difference Result 140 states and 198 transitions. [2019-01-13 22:10:12,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:12,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 22:10:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:12,576 INFO L225 Difference]: With dead ends: 140 [2019-01-13 22:10:12,576 INFO L226 Difference]: Without dead ends: 137 [2019-01-13 22:10:12,576 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:10:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-13 22:10:12,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 126. [2019-01-13 22:10:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-13 22:10:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2019-01-13 22:10:12,607 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 11 [2019-01-13 22:10:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:12,611 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2019-01-13 22:10:12,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2019-01-13 22:10:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 22:10:12,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:12,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:12,612 INFO L423 AbstractCegarLoop]: === Iteration 5 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:12,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:12,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1038361485, now seen corresponding path program 1 times [2019-01-13 22:10:12,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:12,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:12,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:12,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:12,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:12,683 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:12,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:12,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:12,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:12,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:12,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:12,685 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand 3 states. [2019-01-13 22:10:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:13,136 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-01-13 22:10:13,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:13,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-13 22:10:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:13,141 INFO L225 Difference]: With dead ends: 214 [2019-01-13 22:10:13,141 INFO L226 Difference]: Without dead ends: 214 [2019-01-13 22:10:13,142 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:10:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-13 22:10:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 193. [2019-01-13 22:10:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-13 22:10:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 298 transitions. [2019-01-13 22:10:13,160 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 298 transitions. Word has length 13 [2019-01-13 22:10:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:13,160 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 298 transitions. [2019-01-13 22:10:13,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 298 transitions. [2019-01-13 22:10:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 22:10:13,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:13,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:13,161 INFO L423 AbstractCegarLoop]: === Iteration 6 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:13,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1038361486, now seen corresponding path program 1 times [2019-01-13 22:10:13,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:13,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:13,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:13,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:13,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:13,244 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:13,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:13,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:13,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:13,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:13,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:13,246 INFO L87 Difference]: Start difference. First operand 193 states and 298 transitions. Second operand 3 states. [2019-01-13 22:10:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:13,483 INFO L93 Difference]: Finished difference Result 265 states and 395 transitions. [2019-01-13 22:10:13,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:13,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-13 22:10:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:13,488 INFO L225 Difference]: With dead ends: 265 [2019-01-13 22:10:13,488 INFO L226 Difference]: Without dead ends: 265 [2019-01-13 22:10:13,489 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:10:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-13 22:10:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2019-01-13 22:10:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-13 22:10:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 382 transitions. [2019-01-13 22:10:13,508 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 382 transitions. Word has length 13 [2019-01-13 22:10:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:13,508 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 382 transitions. [2019-01-13 22:10:13,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 382 transitions. [2019-01-13 22:10:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 22:10:13,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:13,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:13,511 INFO L423 AbstractCegarLoop]: === Iteration 7 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:13,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:13,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2124441954, now seen corresponding path program 1 times [2019-01-13 22:10:13,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:13,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:13,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:13,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:13,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:13,671 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:13,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:13,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:10:13,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:10:13,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:10:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:10:13,672 INFO L87 Difference]: Start difference. First operand 247 states and 382 transitions. Second operand 5 states. [2019-01-13 22:10:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:13,795 INFO L93 Difference]: Finished difference Result 467 states and 697 transitions. [2019-01-13 22:10:13,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:10:13,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-13 22:10:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:13,801 INFO L225 Difference]: With dead ends: 467 [2019-01-13 22:10:13,802 INFO L226 Difference]: Without dead ends: 467 [2019-01-13 22:10:13,803 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:10:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-01-13 22:10:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 439. [2019-01-13 22:10:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-01-13 22:10:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 675 transitions. [2019-01-13 22:10:13,833 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 675 transitions. Word has length 14 [2019-01-13 22:10:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:13,834 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 675 transitions. [2019-01-13 22:10:13,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:10:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 675 transitions. [2019-01-13 22:10:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:10:13,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:13,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:13,840 INFO L423 AbstractCegarLoop]: === Iteration 8 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:13,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:13,841 INFO L82 PathProgramCache]: Analyzing trace with hash -98286522, now seen corresponding path program 1 times [2019-01-13 22:10:13,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:13,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:13,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:13,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:13,940 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:13,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:13,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:10:13,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:10:13,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:10:13,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:10:13,942 INFO L87 Difference]: Start difference. First operand 439 states and 675 transitions. Second operand 5 states. [2019-01-13 22:10:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:14,112 INFO L93 Difference]: Finished difference Result 819 states and 1183 transitions. [2019-01-13 22:10:14,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:10:14,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-13 22:10:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:14,121 INFO L225 Difference]: With dead ends: 819 [2019-01-13 22:10:14,122 INFO L226 Difference]: Without dead ends: 819 [2019-01-13 22:10:14,122 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:10:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-01-13 22:10:14,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 787. [2019-01-13 22:10:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-01-13 22:10:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1155 transitions. [2019-01-13 22:10:14,189 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1155 transitions. Word has length 15 [2019-01-13 22:10:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:14,189 INFO L480 AbstractCegarLoop]: Abstraction has 787 states and 1155 transitions. [2019-01-13 22:10:14,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:10:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1155 transitions. [2019-01-13 22:10:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 22:10:14,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:14,193 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:10:14,193 INFO L423 AbstractCegarLoop]: === Iteration 9 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:14,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:14,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1015802146, now seen corresponding path program 1 times [2019-01-13 22:10:14,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:14,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:14,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:14,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:14,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:14,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:10:14,390 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:10:14,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:14,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:10:14,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:10:14,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-01-13 22:10:14,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 22:10:14,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 22:10:14,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:10:14,837 INFO L87 Difference]: Start difference. First operand 787 states and 1155 transitions. Second operand 10 states. [2019-01-13 22:10:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:15,573 INFO L93 Difference]: Finished difference Result 2569 states and 3817 transitions. [2019-01-13 22:10:15,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 22:10:15,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-01-13 22:10:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:15,594 INFO L225 Difference]: With dead ends: 2569 [2019-01-13 22:10:15,595 INFO L226 Difference]: Without dead ends: 2569 [2019-01-13 22:10:15,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:10:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2019-01-13 22:10:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2431. [2019-01-13 22:10:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2431 states. [2019-01-13 22:10:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 3565 transitions. [2019-01-13 22:10:15,782 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 3565 transitions. Word has length 22 [2019-01-13 22:10:15,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:15,808 INFO L480 AbstractCegarLoop]: Abstraction has 2431 states and 3565 transitions. [2019-01-13 22:10:15,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 22:10:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 3565 transitions. [2019-01-13 22:10:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 22:10:15,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:15,809 INFO L402 BasicCegarLoop]: trace histogram [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:15,817 INFO L423 AbstractCegarLoop]: === Iteration 10 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:15,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2036870500, now seen corresponding path program 1 times [2019-01-13 22:10:15,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:10:15,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:10:15,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:15,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:15,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:10:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:10:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:10:15,925 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 22:10:15,957 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 22:10:15,976 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:15,978 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:15,983 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:16,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:10:16 BoogieIcfgContainer [2019-01-13 22:10:16,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:10:16,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:10:16,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:10:16,015 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:10:16,017 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:11" (3/4) ... [2019-01-13 22:10:16,021 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 22:10:16,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:10:16,022 INFO L168 Benchmark]: Toolchain (without parser) took 6274.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -243.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:10:16,024 INFO L168 Benchmark]: CDTParser took 0.29 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:10:16,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:16,026 INFO L168 Benchmark]: Boogie Preprocessor took 69.30 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:16,027 INFO L168 Benchmark]: RCFGBuilder took 970.21 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: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:16,028 INFO L168 Benchmark]: TraceAbstraction took 4642.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:10:16,030 INFO L168 Benchmark]: Witness Printer took 6.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:10:16,040 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.29 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 581.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.30 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 970.21 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: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4642.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 6.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 * 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)=21, \old(garbage)=18, \old(pc1)=13, \old(pc4)=22, \old(res4)=14, \old(S)=15, \old(S)=10, \old(t1)=27, \old(t1)=20, \old(t4)=16, \old(t4)=11, \old(x1)=19, \old(x1)=23, \old(x4)=26, \old(x4)=25, 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] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 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))={2:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={2: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))={2:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={2: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))={2:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={2: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={2:0}, x4={0:0}] [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={2:0}, x4={0:0}] [L690] COND FALSE !(S || 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=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={2: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=2, 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, 4.5s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 854 SDtfs, 698 SDslu, 1242 SDs, 0 SdLazy, 336 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2431occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 266 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 5771 SizeOfPredicates, 8 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 2/6 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:18,274 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:10:18,276 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:10:18,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:10:18,292 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:10:18,293 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:10:18,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:10:18,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:10:18,305 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:10:18,306 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:10:18,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:10:18,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:10:18,310 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:10:18,311 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:10:18,313 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:10:18,313 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:10:18,317 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:10:18,327 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:10:18,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:10:18,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:10:18,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:10:18,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:10:18,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:10:18,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:10:18,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:10:18,339 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:10:18,340 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:10:18,340 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:10:18,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:10:18,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:10:18,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:10:18,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:10:18,344 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:10:18,344 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:10:18,345 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:10:18,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:10:18,346 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:18,370 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:10:18,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:10:18,372 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:10:18,375 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:10:18,375 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:10:18,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:10:18,376 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:10:18,376 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:10:18,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:10:18,376 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:10:18,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:10:18,377 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:10:18,378 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:10:18,378 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:10:18,378 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:10:18,379 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-13 22:10:18,379 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-13 22:10:18,379 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:10:18,379 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:10:18,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:10:18,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:10:18,379 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:10:18,382 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:10:18,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:10:18,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:10:18,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:10:18,383 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-13 22:10:18,383 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:10:18,384 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-13 22:10:18,384 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 -> 1cdc9955d0f744a8bccc682f75e63a6c9ebbfe78 [2019-01-13 22:10:18,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:10:18,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:10:18,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:10:18,468 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:10:18,468 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:10:18,469 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/lockfree-3.2_false-valid-memtrack.i [2019-01-13 22:10:18,531 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44baa56a/75f557a2db7948bf9b9bd072ac49cbe9/FLAG56108e39f [2019-01-13 22:10:19,015 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:10:19,016 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/lockfree-3.2_false-valid-memtrack.i [2019-01-13 22:10:19,028 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44baa56a/75f557a2db7948bf9b9bd072ac49cbe9/FLAG56108e39f [2019-01-13 22:10:19,293 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44baa56a/75f557a2db7948bf9b9bd072ac49cbe9 [2019-01-13 22:10:19,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:10:19,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:10:19,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:10:19,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:10:19,303 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:10:19,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:10:19" (1/1) ... [2019-01-13 22:10:19,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525e61c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:19, skipping insertion in model container [2019-01-13 22:10:19,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:10:19" (1/1) ... [2019-01-13 22:10:19,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:10:19,372 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:10:19,719 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:10:19,735 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:10:19,877 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:10:19,929 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:10:19,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:19 WrapperNode [2019-01-13 22:10:19,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:10:19,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:10:19,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:10:19,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:10:19,945 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:19" (1/1) ... [2019-01-13 22:10:19,946 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:19" (1/1) ... [2019-01-13 22:10:19,971 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:19" (1/1) ... [2019-01-13 22:10:19,972 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:19" (1/1) ... [2019-01-13 22:10:19,998 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:19" (1/1) ... [2019-01-13 22:10:20,007 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:19" (1/1) ... [2019-01-13 22:10:20,011 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:19" (1/1) ... [2019-01-13 22:10:20,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:10:20,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:10:20,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:10:20,018 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:10:20,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:19" (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:20,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:10:20,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:10:20,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:10:20,095 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2019-01-13 22:10:20,095 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2019-01-13 22:10:20,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:10:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 22:10:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:10:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:10:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:10:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:10:20,096 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:10:20,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:10:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:10:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:10:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:10:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:10:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:10:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:10:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:10:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:10:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:10:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:10:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:10:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:10:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:10:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:10:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:10:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:10:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:10:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:10:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:10:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:10:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:10:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:10:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:10:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:10:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:10:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:10:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:10:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:10:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:10:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:10:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:10:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:10:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:10:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:10:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:10:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:10:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:10:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:10:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:10:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:10:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:10:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:10:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:10:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:10:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:10:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:10:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:10:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:10:20,115 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:10:20,115 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:10:20,115 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:10:20,115 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:10:20,116 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:10:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:10:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:10:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:10:20,118 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:10:20,118 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:10:20,118 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 22:10:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:10:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:10:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:10:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:10:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:10:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:10:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:10:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:10:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:10:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:10:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:10:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:10:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:10:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:10:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:10:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:10:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:10:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:10:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:10:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:10:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:10:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:10:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:10:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:10:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:10:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:10:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:10:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:10:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:10:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:10:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:10:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:10:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:10:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:10:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:10:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:10:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:10:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure push [2019-01-13 22:10:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:10:20,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-13 22:10:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:10:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2019-01-13 22:10:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:10:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-13 22:10:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:10:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:10:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:10:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:10:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:10:21,182 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:10:21,182 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 22:10:21,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:10:21 BoogieIcfgContainer [2019-01-13 22:10:21,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:10:21,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:10:21,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:10:21,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:10:21,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:10:19" (1/3) ... [2019-01-13 22:10:21,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b3c036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:10:21, skipping insertion in model container [2019-01-13 22:10:21,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:19" (2/3) ... [2019-01-13 22:10:21,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b3c036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:10:21, skipping insertion in model container [2019-01-13 22:10:21,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:10:21" (3/3) ... [2019-01-13 22:10:21,194 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.2_false-valid-memtrack.i [2019-01-13 22:10:21,205 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:10:21,213 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-13 22:10:21,231 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-13 22:10:21,257 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:10:21,258 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:10:21,258 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:10:21,258 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:10:21,259 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:10:21,259 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:10:21,260 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:10:21,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:10:21,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:10:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2019-01-13 22:10:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-13 22:10:21,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:21,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:21,292 INFO L423 AbstractCegarLoop]: === Iteration 1 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:21,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:21,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1065245696, now seen corresponding path program 1 times [2019-01-13 22:10:21,304 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:21,304 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:21,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:21,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:21,427 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:21,427 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 22:10:21,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:21,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:21,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-13 22:10:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-13 22:10:21,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-13 22:10:21,452 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 2 states. [2019-01-13 22:10:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:21,472 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-01-13 22:10:21,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-13 22:10:21,473 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-13 22:10:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:21,492 INFO L225 Difference]: With dead ends: 72 [2019-01-13 22:10:21,493 INFO L226 Difference]: Without dead ends: 69 [2019-01-13 22:10:21,495 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:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-13 22:10:21,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-13 22:10:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-13 22:10:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-01-13 22:10:21,540 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 8 [2019-01-13 22:10:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:21,541 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-01-13 22:10:21,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-13 22:10:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-01-13 22:10:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-13 22:10:21,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:21,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:21,543 INFO L423 AbstractCegarLoop]: === Iteration 2 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:21,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:21,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1065234164, now seen corresponding path program 1 times [2019-01-13 22:10:21,543 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:21,544 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:21,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:21,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:21,738 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:21,738 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:21,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:21,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:10:21,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:21,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:21,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:21,748 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2019-01-13 22:10:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:21,970 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2019-01-13 22:10:21,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:21,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-13 22:10:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:21,975 INFO L225 Difference]: With dead ends: 120 [2019-01-13 22:10:21,975 INFO L226 Difference]: Without dead ends: 120 [2019-01-13 22:10:21,977 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:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-13 22:10:21,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2019-01-13 22:10:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-13 22:10:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2019-01-13 22:10:21,993 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 8 [2019-01-13 22:10:21,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:21,994 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2019-01-13 22:10:21,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2019-01-13 22:10:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:10:21,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:21,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:21,995 INFO L423 AbstractCegarLoop]: === Iteration 3 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:21,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:21,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1337480689, now seen corresponding path program 1 times [2019-01-13 22:10:21,996 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:21,996 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:22,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:22,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:22,129 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:22,130 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:22,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:22,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:22,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:22,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:22,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:22,135 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand 3 states. [2019-01-13 22:10:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:22,648 INFO L93 Difference]: Finished difference Result 128 states and 182 transitions. [2019-01-13 22:10:22,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:22,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-13 22:10:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:22,653 INFO L225 Difference]: With dead ends: 128 [2019-01-13 22:10:22,653 INFO L226 Difference]: Without dead ends: 125 [2019-01-13 22:10:22,653 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:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-13 22:10:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2019-01-13 22:10:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-13 22:10:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-01-13 22:10:22,676 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 9 [2019-01-13 22:10:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:22,677 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-01-13 22:10:22,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-01-13 22:10:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:10:22,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:22,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:22,678 INFO L423 AbstractCegarLoop]: === Iteration 4 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:22,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:22,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1079345167, now seen corresponding path program 1 times [2019-01-13 22:10:22,679 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:22,679 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:22,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:22,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:22,902 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:22,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:10:22,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:10:22,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 22:10:22,985 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:22,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:22,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:22,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:22,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:22,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:22,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:22,993 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 3 states. [2019-01-13 22:10:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:23,397 INFO L93 Difference]: Finished difference Result 198 states and 290 transitions. [2019-01-13 22:10:23,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:23,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 22:10:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:23,401 INFO L225 Difference]: With dead ends: 198 [2019-01-13 22:10:23,402 INFO L226 Difference]: Without dead ends: 198 [2019-01-13 22:10:23,402 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:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-13 22:10:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 177. [2019-01-13 22:10:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-13 22:10:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 276 transitions. [2019-01-13 22:10:23,421 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 276 transitions. Word has length 11 [2019-01-13 22:10:23,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:23,421 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 276 transitions. [2019-01-13 22:10:23,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 276 transitions. [2019-01-13 22:10:23,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:10:23,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:23,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:23,423 INFO L423 AbstractCegarLoop]: === Iteration 5 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:23,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:23,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1079345166, now seen corresponding path program 1 times [2019-01-13 22:10:23,424 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:23,424 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:23,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:23,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:23,589 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:23,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:10:23,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:10:23,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:10:23,632 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:23,633 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:23,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:23,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:10:23,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:10:23,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:10:23,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:10:23,637 INFO L87 Difference]: Start difference. First operand 177 states and 276 transitions. Second operand 3 states. [2019-01-13 22:10:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:23,890 INFO L93 Difference]: Finished difference Result 249 states and 373 transitions. [2019-01-13 22:10:23,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:10:23,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 22:10:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:23,898 INFO L225 Difference]: With dead ends: 249 [2019-01-13 22:10:23,898 INFO L226 Difference]: Without dead ends: 249 [2019-01-13 22:10:23,898 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:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-13 22:10:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2019-01-13 22:10:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-13 22:10:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 360 transitions. [2019-01-13 22:10:23,921 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 360 transitions. Word has length 11 [2019-01-13 22:10:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:23,922 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 360 transitions. [2019-01-13 22:10:23,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:10:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 360 transitions. [2019-01-13 22:10:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 22:10:23,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:23,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:23,923 INFO L423 AbstractCegarLoop]: === Iteration 6 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:23,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:23,924 INFO L82 PathProgramCache]: Analyzing trace with hash 900045188, now seen corresponding path program 1 times [2019-01-13 22:10:23,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:23,924 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:23,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:24,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:24,052 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:24,052 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:24,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:24,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:10:24,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 22:10:24,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 22:10:24,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:10:24,058 INFO L87 Difference]: Start difference. First operand 231 states and 360 transitions. Second operand 4 states. [2019-01-13 22:10:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:24,122 INFO L93 Difference]: Finished difference Result 212 states and 298 transitions. [2019-01-13 22:10:24,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:10:24,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-13 22:10:24,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:24,125 INFO L225 Difference]: With dead ends: 212 [2019-01-13 22:10:24,125 INFO L226 Difference]: Without dead ends: 212 [2019-01-13 22:10:24,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:10:24,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-13 22:10:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 181. [2019-01-13 22:10:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-13 22:10:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2019-01-13 22:10:24,140 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 12 [2019-01-13 22:10:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:24,141 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2019-01-13 22:10:24,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 22:10:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2019-01-13 22:10:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 22:10:24,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:24,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:10:24,142 INFO L423 AbstractCegarLoop]: === Iteration 7 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:24,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:24,143 INFO L82 PathProgramCache]: Analyzing trace with hash 600119434, now seen corresponding path program 1 times [2019-01-13 22:10:24,143 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:24,143 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:24,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:10:24,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:10:24,286 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:24,286 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:10:24,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:10:24,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:10:24,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 22:10:24,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 22:10:24,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:10:24,289 INFO L87 Difference]: Start difference. First operand 181 states and 271 transitions. Second operand 4 states. [2019-01-13 22:10:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:10:24,356 INFO L93 Difference]: Finished difference Result 281 states and 404 transitions. [2019-01-13 22:10:24,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:10:24,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-01-13 22:10:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:10:24,365 INFO L225 Difference]: With dead ends: 281 [2019-01-13 22:10:24,365 INFO L226 Difference]: Without dead ends: 281 [2019-01-13 22:10:24,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:10:24,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-13 22:10:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2019-01-13 22:10:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-13 22:10:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 404 transitions. [2019-01-13 22:10:24,386 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 404 transitions. Word has length 13 [2019-01-13 22:10:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:10:24,387 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 404 transitions. [2019-01-13 22:10:24,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 22:10:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 404 transitions. [2019-01-13 22:10:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 22:10:24,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:10:24,388 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:24,388 INFO L423 AbstractCegarLoop]: === Iteration 8 === [popErr0REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION]=== [2019-01-13 22:10:24,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:10:24,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1959085003, now seen corresponding path program 1 times [2019-01-13 22:10:24,389 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:10:24,389 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:24,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:10:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:10:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:10:24,777 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 22:10:24,831 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 22:10:24,840 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,840 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,840 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,841 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,841 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,841 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,841 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,842 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,842 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,842 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,842 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,842 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,847 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,847 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,847 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,847 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,847 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,849 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,849 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,849 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,850 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,850 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,850 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,850 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,852 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,852 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,853 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,853 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,853 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,853 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,854 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:24,855 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,855 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,855 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,855 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,856 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,856 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,858 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,858 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,859 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,859 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,859 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,859 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:24,859 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,860 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,861 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,861 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,861 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,861 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,863 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,864 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,864 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,865 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,865 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,866 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,866 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,866 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:24,866 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,867 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,867 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,867 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,867 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,868 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,870 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,870 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,871 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,871 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,872 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,872 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,872 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,873 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,873 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,873 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,873 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,876 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,877 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,878 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,878 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,878 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,878 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,879 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,880 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,880 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,881 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,881 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,882 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,882 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,883 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,883 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,885 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,885 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,885 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,885 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,886 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,887 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,887 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,887 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,887 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,888 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell [2019-01-13 22:10:24,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:10:24 BoogieIcfgContainer [2019-01-13 22:10:24,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:10:24,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:10:24,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:10:24,898 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:10:24,899 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:21" (3/4) ... [2019-01-13 22:10:24,904 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 22:10:24,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:10:24,905 INFO L168 Benchmark]: Toolchain (without parser) took 5607.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 952.7 MB in the beginning and 847.4 MB in the end (delta: 105.2 MB). Peak memory consumption was 241.0 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:24,906 INFO L168 Benchmark]: CDTParser took 0.14 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:10:24,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:24,909 INFO L168 Benchmark]: Boogie Preprocessor took 87.29 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:24,909 INFO L168 Benchmark]: RCFGBuilder took 1166.41 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: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:24,911 INFO L168 Benchmark]: TraceAbstraction took 3712.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 847.4 MB in the end (delta: 209.9 MB). Peak memory consumption was 209.9 MB. Max. memory is 11.5 GB. [2019-01-13 22:10:24,911 INFO L168 Benchmark]: Witness Printer took 5.93 ms. Allocated memory is still 1.2 GB. Free memory is still 847.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:10:24,917 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 631.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.29 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1166.41 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: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3712.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 847.4 MB in the end (delta: 209.9 MB). Peak memory consumption was 209.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.93 ms. Allocated memory is still 1.2 GB. Free memory is still 847.4 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: 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: 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 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType *cell - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 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 S || 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 FALSE !(S || 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=2, pc4=1, res4=0, S={0: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=2, 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, 3.6s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 664 SDtfs, 386 SDslu, 441 SDs, 0 SdLazy, 146 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 98 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 1685 SizeOfPredicates, 13 NumberOfNonLiveVariables, 900 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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...