./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a3a274b64e7ba6d81948d0b8c45cbd715251888 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a3a274b64e7ba6d81948d0b8c45cbd715251888 ................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: Indexed Sort BitVec undefined --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:46:10,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:46:10,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:46:10,363 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:46:10,363 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:46:10,364 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:46:10,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:46:10,366 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:46:10,367 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:46:10,368 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:46:10,369 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:46:10,369 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:46:10,369 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:46:10,370 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:46:10,371 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:46:10,372 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:46:10,372 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:46:10,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:46:10,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:46:10,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:46:10,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:46:10,378 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:46:10,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:46:10,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:46:10,381 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:46:10,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:46:10,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:46:10,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:46:10,383 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:46:10,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:46:10,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:46:10,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:46:10,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:46:10,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:46:10,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:46:10,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:46:10,387 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-23 14:46:10,398 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:46:10,398 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:46:10,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:46:10,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:46:10,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:46:10,400 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:46:10,400 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:46:10,400 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:46:10,400 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:46:10,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:46:10,400 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 14:46:10,400 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 14:46:10,401 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 14:46:10,401 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:46:10,401 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:46:10,401 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:46:10,401 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 14:46:10,401 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 14:46:10,402 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:46:10,402 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:46:10,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 14:46:10,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:46:10,402 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:46:10,402 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 14:46:10,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:46:10,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak 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 -> Kojak 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 -> 5a3a274b64e7ba6d81948d0b8c45cbd715251888 [2018-11-23 14:46:10,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:46:10,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:46:10,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:46:10,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:46:10,437 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:46:10,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 14:46:10,474 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/data/330fc1eef/01f667aa8847453991c6eb44091c6764/FLAGd9c5f37db [2018-11-23 14:46:10,853 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:46:10,853 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 14:46:10,862 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/data/330fc1eef/01f667aa8847453991c6eb44091c6764/FLAGd9c5f37db [2018-11-23 14:46:11,237 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/data/330fc1eef/01f667aa8847453991c6eb44091c6764 [2018-11-23 14:46:11,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:46:11,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:46:11,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:46:11,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:46:11,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:46:11,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:46:11" (1/1) ... [2018-11-23 14:46:11,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266c39f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11, skipping insertion in model container [2018-11-23 14:46:11,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:46:11" (1/1) ... [2018-11-23 14:46:11,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:46:11,279 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:46:11,464 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:46:11,470 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:46:11,541 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:46:11,566 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:46:11,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11 WrapperNode [2018-11-23 14:46:11,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:46:11,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:46:11,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:46:11,567 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:46:11,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11" (1/1) ... [2018-11-23 14:46:11,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11" (1/1) ... [2018-11-23 14:46:11,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:46:11,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:46:11,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:46:11,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:46:11,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11" (1/1) ... [2018-11-23 14:46:11,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11" (1/1) ... [2018-11-23 14:46:11,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11" (1/1) ... [2018-11-23 14:46:11,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11" (1/1) ... [2018-11-23 14:46:11,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11" (1/1) ... [2018-11-23 14:46:11,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11" (1/1) ... [2018-11-23 14:46:11,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11" (1/1) ... [2018-11-23 14:46:11,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:46:11,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:46:11,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:46:11,623 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:46:11,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 14:46:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:46:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:46:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:46:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 14:46:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 14:46:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:46:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:46:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:46:12,049 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:46:12,049 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 14:46:12,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:12 BoogieIcfgContainer [2018-11-23 14:46:12,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:46:12,050 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 14:46:12,050 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 14:46:12,058 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 14:46:12,058 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:12" (1/1) ... [2018-11-23 14:46:12,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:46:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 81 states and 93 transitions. [2018-11-23 14:46:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2018-11-23 14:46:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-11-23 14:46:12,095 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 80 states and 92 transitions. [2018-11-23 14:46:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-11-23 14:46:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-11-23 14:46:12,225 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 79 states and 91 transitions. [2018-11-23 14:46:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2018-11-23 14:46:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 14:46:12,366 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 78 states and 90 transitions. [2018-11-23 14:46:12,396 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2018-11-23 14:46:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 14:46:12,397 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 77 states and 89 transitions. [2018-11-23 14:46:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2018-11-23 14:46:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 14:46:12,437 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 76 states and 87 transitions. [2018-11-23 14:46:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-23 14:46:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 14:46:12,539 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 79 states and 92 transitions. [2018-11-23 14:46:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2018-11-23 14:46:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:46:12,720 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 78 states and 91 transitions. [2018-11-23 14:46:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-11-23 14:46:12,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:46:12,754 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 77 states and 90 transitions. [2018-11-23 14:46:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2018-11-23 14:46:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 14:46:12,965 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 82 states and 99 transitions. [2018-11-23 14:46:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-23 14:46:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 14:46:13,075 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 87 states and 109 transitions. [2018-11-23 14:46:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2018-11-23 14:46:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 14:46:13,323 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 86 states and 108 transitions. [2018-11-23 14:46:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2018-11-23 14:46:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 14:46:13,345 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 85 states and 107 transitions. [2018-11-23 14:46:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2018-11-23 14:46:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 14:46:13,370 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 87 states and 110 transitions. [2018-11-23 14:46:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2018-11-23 14:46:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 14:46:13,668 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 89 states and 113 transitions. [2018-11-23 14:46:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2018-11-23 14:46:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 14:46:14,094 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 88 states and 112 transitions. [2018-11-23 14:46:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-11-23 14:46:14,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 14:46:14,124 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 87 states and 111 transitions. [2018-11-23 14:46:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2018-11-23 14:46:14,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 14:46:14,155 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 76 states and 94 transitions. [2018-11-23 14:46:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2018-11-23 14:46:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 14:46:14,298 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 75 states and 93 transitions. [2018-11-23 14:46:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2018-11-23 14:46:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 14:46:14,368 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 76 states and 95 transitions. [2018-11-23 14:46:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2018-11-23 14:46:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 14:46:14,384 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 77 states and 96 transitions. [2018-11-23 14:46:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-11-23 14:46:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:46:14,407 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 76 states and 95 transitions. [2018-11-23 14:46:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2018-11-23 14:46:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:46:14,437 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 79 states and 100 transitions. [2018-11-23 14:46:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2018-11-23 14:46:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:46:14,624 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 76 states and 96 transitions. [2018-11-23 14:46:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2018-11-23 14:46:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:46:14,661 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 73 states and 93 transitions. [2018-11-23 14:46:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-11-23 14:46:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:46:14,711 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 75 states and 96 transitions. [2018-11-23 14:46:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2018-11-23 14:46:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:46:14,767 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 77 states and 100 transitions. [2018-11-23 14:46:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2018-11-23 14:46:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 14:46:14,940 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 76 states and 99 transitions. [2018-11-23 14:46:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2018-11-23 14:46:14,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 14:46:14,974 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 77 states and 101 transitions. [2018-11-23 14:46:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2018-11-23 14:46:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 14:46:15,043 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 83 states and 110 transitions. [2018-11-23 14:46:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2018-11-23 14:46:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 14:46:15,910 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 82 states and 109 transitions. [2018-11-23 14:46:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2018-11-23 14:46:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 14:46:15,936 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 83 states and 110 transitions. [2018-11-23 14:46:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2018-11-23 14:46:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 14:46:16,038 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 82 states and 109 transitions. [2018-11-23 14:46:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2018-11-23 14:46:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 14:46:16,079 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 84 states and 113 transitions. [2018-11-23 14:46:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2018-11-23 14:46:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 14:46:16,124 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 83 states and 112 transitions. [2018-11-23 14:46:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2018-11-23 14:46:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 14:46:16,152 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 84 states and 115 transitions. [2018-11-23 14:46:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 115 transitions. [2018-11-23 14:46:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 14:46:16,202 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 90 states and 126 transitions. [2018-11-23 14:46:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2018-11-23 14:46:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 14:46:17,037 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 96 states and 137 transitions. [2018-11-23 14:46:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 137 transitions. [2018-11-23 14:46:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 14:46:18,008 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 107 states and 157 transitions. [2018-11-23 14:46:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2018-11-23 14:46:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 14:46:20,143 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 109 states and 159 transitions. [2018-11-23 14:46:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2018-11-23 14:46:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 14:46:20,827 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 115 states and 172 transitions. [2018-11-23 14:46:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2018-11-23 14:46:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 14:46:22,019 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 123 states and 189 transitions. [2018-11-23 14:46:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2018-11-23 14:46:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 14:46:23,525 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 126 states and 195 transitions. [2018-11-23 14:46:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2018-11-23 14:46:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 14:46:23,565 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 129 states and 202 transitions. [2018-11-23 14:46:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 202 transitions. [2018-11-23 14:46:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 14:46:24,215 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 140 states and 227 transitions. [2018-11-23 14:46:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 227 transitions. [2018-11-23 14:46:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 14:46:27,145 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 141 states and 228 transitions. [2018-11-23 14:46:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 228 transitions. [2018-11-23 14:46:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 14:46:27,185 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 143 states and 235 transitions. [2018-11-23 14:46:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 235 transitions. [2018-11-23 14:46:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 14:46:27,439 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 14:46:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 146 states and 243 transitions. [2018-11-23 14:46:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 243 transitions. [2018-11-23 14:46:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 14:46:29,759 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 154 states and 258 transitions. [2018-11-23 14:46:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 258 transitions. [2018-11-23 14:46:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:46:33,900 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 157 states and 265 transitions. [2018-11-23 14:46:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 265 transitions. [2018-11-23 14:46:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:46:36,012 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 159 states and 272 transitions. [2018-11-23 14:46:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 272 transitions. [2018-11-23 14:46:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:46:37,030 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 160 states and 273 transitions. [2018-11-23 14:46:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 273 transitions. [2018-11-23 14:46:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:46:37,639 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 162 states and 279 transitions. [2018-11-23 14:46:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 279 transitions. [2018-11-23 14:46:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:46:38,773 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 172 states and 302 transitions. [2018-11-23 14:46:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 302 transitions. [2018-11-23 14:46:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:46:43,382 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 182 states and 326 transitions. [2018-11-23 14:46:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 326 transitions. [2018-11-23 14:46:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:46:47,659 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 187 states and 337 transitions. [2018-11-23 14:46:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 337 transitions. [2018-11-23 14:46:50,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:46:50,043 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 189 states and 345 transitions. [2018-11-23 14:46:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 345 transitions. [2018-11-23 14:46:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:46:50,356 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 195 states and 355 transitions. [2018-11-23 14:46:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 355 transitions. [2018-11-23 14:46:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:46:51,982 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 201 states and 365 transitions. [2018-11-23 14:46:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 365 transitions. [2018-11-23 14:46:53,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:46:53,942 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:46:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:46:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 207 states and 374 transitions. [2018-11-23 14:46:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 374 transitions. [2018-11-23 14:46:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:46:56,165 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:46:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:46:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 216 states and 398 transitions. [2018-11-23 14:47:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 398 transitions. [2018-11-23 14:47:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:47:02,657 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 221 states and 411 transitions. [2018-11-23 14:47:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 411 transitions. [2018-11-23 14:47:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:47:05,562 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 223 states and 416 transitions. [2018-11-23 14:47:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 416 transitions. [2018-11-23 14:47:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:47:06,860 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 220 states and 409 transitions. [2018-11-23 14:47:06,867 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 409 transitions. [2018-11-23 14:47:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:47:06,867 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 230 states and 429 transitions. [2018-11-23 14:47:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 429 transitions. [2018-11-23 14:47:14,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:14,171 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 241 states and 455 transitions. [2018-11-23 14:47:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 455 transitions. [2018-11-23 14:47:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:18,983 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 247 states and 472 transitions. [2018-11-23 14:47:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 472 transitions. [2018-11-23 14:47:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:21,904 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 253 states and 488 transitions. [2018-11-23 14:47:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 488 transitions. [2018-11-23 14:47:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:24,321 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 257 states and 504 transitions. [2018-11-23 14:47:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 504 transitions. [2018-11-23 14:47:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:26,972 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 261 states and 517 transitions. [2018-11-23 14:47:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 517 transitions. [2018-11-23 14:47:29,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:29,584 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 263 states and 522 transitions. [2018-11-23 14:47:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 522 transitions. [2018-11-23 14:47:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:31,013 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 266 states and 529 transitions. [2018-11-23 14:47:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 529 transitions. [2018-11-23 14:47:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:33,079 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 269 states and 540 transitions. [2018-11-23 14:47:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 540 transitions. [2018-11-23 14:47:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:35,160 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 270 states and 544 transitions. [2018-11-23 14:47:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 544 transitions. [2018-11-23 14:47:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:35,661 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 271 states and 546 transitions. [2018-11-23 14:47:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 546 transitions. [2018-11-23 14:47:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:36,068 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 272 states and 550 transitions. [2018-11-23 14:47:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 550 transitions. [2018-11-23 14:47:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:36,650 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 273 states and 551 transitions. [2018-11-23 14:47:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 551 transitions. [2018-11-23 14:47:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:37,453 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 276 states and 560 transitions. [2018-11-23 14:47:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 560 transitions. [2018-11-23 14:47:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:39,172 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 277 states and 562 transitions. [2018-11-23 14:47:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 562 transitions. [2018-11-23 14:47:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:39,941 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 278 states and 564 transitions. [2018-11-23 14:47:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 564 transitions. [2018-11-23 14:47:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:40,618 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:47:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 279 states and 566 transitions. [2018-11-23 14:47:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 566 transitions. [2018-11-23 14:47:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:41,522 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 14:47:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 286 states and 580 transitions. [2018-11-23 14:47:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 580 transitions. [2018-11-23 14:47:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:45,461 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 14:47:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 293 states and 598 transitions. [2018-11-23 14:47:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 598 transitions. [2018-11-23 14:47:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:49,872 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 14:47:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:47:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 301 states and 616 transitions. [2018-11-23 14:47:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 616 transitions. [2018-11-23 14:47:56,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:47:56,938 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:47:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:47:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:48:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:48:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 303 states and 618 transitions. [2018-11-23 14:48:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 618 transitions. [2018-11-23 14:48:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:48:00,016 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:48:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:48:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:48:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 307 states and 622 transitions. [2018-11-23 14:48:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 622 transitions. [2018-11-23 14:48:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:48:04,943 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:48:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 14:48:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:48:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 291 states and 595 transitions. [2018-11-23 14:48:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 595 transitions. [2018-11-23 14:48:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 14:48:06,796 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:48:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:48:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:48:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 292 states and 596 transitions. [2018-11-23 14:48:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 596 transitions. [2018-11-23 14:48:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 14:48:07,572 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:48:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:48:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:48:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 302 states and 615 transitions. [2018-11-23 14:48:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 615 transitions. [2018-11-23 14:48:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 14:48:18,131 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:48:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:48:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:48:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 304 states and 621 transitions. [2018-11-23 14:48:19,960 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 621 transitions. [2018-11-23 14:48:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:48:19,960 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:48:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:48:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:48:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 306 states and 627 transitions. [2018-11-23 14:48:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 627 transitions. [2018-11-23 14:48:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:48:21,471 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:48:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:48:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:48:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 316 states and 651 transitions. [2018-11-23 14:48:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 651 transitions. [2018-11-23 14:48:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:48:32,077 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:48:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 14:48:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:48:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 321 states and 664 transitions. [2018-11-23 14:48:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 664 transitions. [2018-11-23 14:48:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:48:35,980 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:48:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 14:48:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:48:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 321 states and 663 transitions. [2018-11-23 14:48:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 663 transitions. [2018-11-23 14:48:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:48:36,774 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:48:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:48:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:48:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 330 states and 695 transitions. [2018-11-23 14:48:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 695 transitions. [2018-11-23 14:48:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:48:50,872 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:48:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:48:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:49:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:49:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 336 states and 713 transitions. [2018-11-23 14:49:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 713 transitions. [2018-11-23 14:49:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:49:01,782 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:49:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:49:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 14:49:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:49:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 335 states and 712 transitions. [2018-11-23 14:49:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 712 transitions. [2018-11-23 14:49:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 14:49:01,848 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:49:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:49:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:49:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:49:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 340 states and 727 transitions. [2018-11-23 14:49:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 727 transitions. [2018-11-23 14:49:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 14:49:06,205 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:49:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:49:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:49:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:49:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:49:06,321 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 98 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];main_old_#valid := #valid;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet1, main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet6, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~malloc10.base, main_#t~malloc10.offset, main_~y~0.base, main_~y~0.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem11, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4); srcloc: L989 VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] call write~int(0, main_~head~0.base, 4 + main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~nondet1|=0] [?] assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~nondet4|=0] [?] assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); srcloc: L1015-3 VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~mem8.base|=0, |ULTIMATE.start_main_#t~mem8.offset|=0] [?] assume !(main_#t~mem8.base != 0 || main_#t~mem8.offset != 0);havoc main_#t~mem8.base, main_#t~mem8.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~y~0.base, main_~y~0.offset := main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(8); VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] SUMMARY for call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~x~0.base, main_~x~0.offset, 4); srcloc: L1023 VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] SUMMARY for call write~int(1, main_~x~0.base, 4 + main_~x~0.offset, 4); srcloc: L1023-1 VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] SUMMARY for call write~$Pointer$(main_~y~0.base, main_~y~0.offset, main_~x~0.base, main_~x~0.offset, 4); srcloc: L1024 VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); srcloc: L1032-3 VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0, |ULTIMATE.start_main_#t~mem11|=1] [?] assume !(1 != main_#t~mem11);havoc main_#t~mem11; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=0, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~x~0.base != 0 || main_~x~0.offset != 0);}EndParallelCompositionmain_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] assume !!(main_~x~0.base != 0 || main_~x~0.offset != 0);main_~head~0.base, main_~head~0.offset := main_~x~0.base, main_~x~0.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem16.base, main_#t~mem16.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=0, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] assume 0 == main_~head~0.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=0, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] assume 0 == main_~head~0.base || 1 == #valid[main_~head~0.base];call ULTIMATE.dealloc(main_~head~0.base, main_~head~0.offset); VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=0, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~x~0.base != 0 || main_~x~0.offset != 0);}EndParallelCompositionmain_#res := 0; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=0, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#res|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] assume !(#valid == main_old_#valid); VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~x~0.base=0, ULTIMATE.start_main_~x~0.offset=0, ULTIMATE.start_main_~y~0.base=0, ULTIMATE.start_main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#res|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc10.base|=11, |ULTIMATE.start_main_#t~malloc10.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet1, main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet6, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~malloc10.base, main_#t~malloc10.offset, main_~y~0.base, main_~y~0.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem11, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset; [L988] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L988] main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0] [L989] call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0] [L990] call write~int(0, main_~head~0.base, 4 + main_~head~0.offset, 4); [L992] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L995] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet1=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L995-L1002] assume !(0 != main_#t~nondet1); [L995] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1005] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet4=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1005-L1026] assume !(0 != main_#t~nondet4); [L1005] havoc main_#t~nondet4; [L1014] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1015] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem8.base=0, main_#t~mem8.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1015-L1019] assume !(main_#t~mem8.base != 0 || main_#t~mem8.offset != 0); [L1015] havoc main_#t~mem8.base, main_#t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1022] call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1022] main_~y~0.base, main_~y~0.offset := main_#t~mem9.base, main_#t~mem9.offset; [L1022] havoc main_#t~mem9.base, main_#t~mem9.offset; [L1023] call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1023] call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~x~0.base, main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1024] call write~int(1, main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1025] call write~$Pointer$(main_~y~0.base, main_~y~0.offset, main_~x~0.base, main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1029] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1032] call main_#t~mem11 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_#t~mem11=1, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1032-L1035] assume !(1 != main_#t~mem11); [L1032] havoc main_#t~mem11; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1038] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1038] main_~x~0.base, main_~x~0.offset := main_#t~mem13.base, main_#t~mem13.offset; [L1038] havoc main_#t~mem13.base, main_#t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1039-L1044] assume !(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1047] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1048-L1053] assume !!(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1050] main_~head~0.base, main_~head~0.offset := main_~x~0.base, main_~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1051] call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1051] main_~x~0.base, main_~x~0.offset := main_#t~mem16.base, main_#t~mem16.offset; [L1051] havoc main_#t~mem16.base, main_#t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1052] assert 0 == main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1052] assert 0 == main_~head~0.base || 1 == #valid[main_~head~0.base]; [L1052] call ULTIMATE.dealloc(main_~head~0.base, main_~head~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1048-L1053] assume !(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1055] main_#res := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#res=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L985-L1056] assert #valid == main_old_#valid; VAL [#NULL.base=0, #NULL.offset=0, main_#res=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet1, main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet6, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~malloc10.base, main_#t~malloc10.offset, main_~y~0.base, main_~y~0.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem11, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset; [L988] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L988] main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0] [L989] call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0] [L990] call write~int(0, main_~head~0.base, 4 + main_~head~0.offset, 4); [L992] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L995] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet1=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L995-L1002] assume !(0 != main_#t~nondet1); [L995] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1005] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet4=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1005-L1026] assume !(0 != main_#t~nondet4); [L1005] havoc main_#t~nondet4; [L1014] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1015] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem8.base=0, main_#t~mem8.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1015-L1019] assume !(main_#t~mem8.base != 0 || main_#t~mem8.offset != 0); [L1015] havoc main_#t~mem8.base, main_#t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1022] call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1022] main_~y~0.base, main_~y~0.offset := main_#t~mem9.base, main_#t~mem9.offset; [L1022] havoc main_#t~mem9.base, main_#t~mem9.offset; [L1023] call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1023] call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~x~0.base, main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1024] call write~int(1, main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1025] call write~$Pointer$(main_~y~0.base, main_~y~0.offset, main_~x~0.base, main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1029] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1032] call main_#t~mem11 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_#t~mem11=1, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1032-L1035] assume !(1 != main_#t~mem11); [L1032] havoc main_#t~mem11; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1038] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1038] main_~x~0.base, main_~x~0.offset := main_#t~mem13.base, main_#t~mem13.offset; [L1038] havoc main_#t~mem13.base, main_#t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1039-L1044] assume !(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1047] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1048-L1053] assume !!(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1050] main_~head~0.base, main_~head~0.offset := main_~x~0.base, main_~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1051] call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1051] main_~x~0.base, main_~x~0.offset := main_#t~mem16.base, main_#t~mem16.offset; [L1051] havoc main_#t~mem16.base, main_#t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1052] assert 0 == main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1052] assert 0 == main_~head~0.base || 1 == #valid[main_~head~0.base]; [L1052] call ULTIMATE.dealloc(main_~head~0.base, main_~head~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L1048-L1053] assume !(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1055] main_#res := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#res=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [L985-L1056] assert #valid == main_old_#valid; VAL [#NULL.base=0, #NULL.offset=0, main_#res=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc10.base=11, main_#t~malloc10.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc2, main_#t~mem3, main_#t~nondet1, main_#t~nondet4, main_#t~malloc5, main_#t~nondet6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~malloc10, main_~y~0, main_#t~mem12, main_#t~mem11, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_~head~0, main_~x~0; [L988] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L988] main_~head~0 := main_#t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~head~0!base, offset: main_~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0] [L990] FCALL call write~int(0, { base: main_~head~0!base, offset: 4 + main_~head~0!offset }, 4); [L992] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L995] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet1=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L995-L1002] COND TRUE !(0 != main_#t~nondet1) [L995] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1005] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet4=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1005-L1026] COND FALSE !(0 != main_#t~nondet4) [L1005] havoc main_#t~nondet4; [L1014] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1015] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem8!base=0, main_#t~mem8!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1015-L1019] COND TRUE !(main_#t~mem8 != { base: 0, offset: 0 }) [L1015] havoc main_#t~mem8; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1022] FCALL call main_#t~mem9 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1022] main_~y~0 := main_#t~mem9; [L1022] havoc main_#t~mem9; [L1023] FCALL call main_#t~malloc10 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1023] FCALL call write~$Pointer$(main_#t~malloc10, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1024] FCALL call write~int(1, { base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1025] FCALL call write~$Pointer$(main_~y~0, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1029] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1032] FCALL call main_#t~mem11 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_#t~mem11=1, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1032-L1035] COND TRUE !(1 != main_#t~mem11) [L1032] havoc main_#t~mem11; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1038] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1038] main_~x~0 := main_#t~mem13; [L1038] havoc main_#t~mem13; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1039-L1044] COND TRUE !(main_~x~0 != { base: 0, offset: 0 }) [L1047] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1048-L1053] COND FALSE !(!(main_~x~0 != { base: 0, offset: 0 })) [L1050] main_~head~0 := main_~x~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1051] FCALL call main_#t~mem16 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1051] main_~x~0 := main_#t~mem16; [L1051] havoc main_#t~mem16; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1052] assert 0 == main_~head~0!offset; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1052] assert 0 == main_~head~0!base || 1 == #valid[main_~head~0!base]; [L1052] FCALL call ULTIMATE.dealloc(main_~head~0); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1048-L1053] COND TRUE !(main_~x~0 != { base: 0, offset: 0 }) [L1055] main_#res := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#res=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L985-L1056] assert #valid == main_old_#valid; VAL [#NULL!base=0, #NULL!offset=0, main_#res=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc2, main_#t~mem3, main_#t~nondet1, main_#t~nondet4, main_#t~malloc5, main_#t~nondet6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~malloc10, main_~y~0, main_#t~mem12, main_#t~mem11, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_~head~0, main_~x~0; [L988] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L988] main_~head~0 := main_#t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~head~0!base, offset: main_~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0] [L990] FCALL call write~int(0, { base: main_~head~0!base, offset: 4 + main_~head~0!offset }, 4); [L992] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L995] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet1=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L995-L1002] COND TRUE !(0 != main_#t~nondet1) [L995] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1005] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet4=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1005-L1026] COND FALSE !(0 != main_#t~nondet4) [L1005] havoc main_#t~nondet4; [L1014] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1015] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem8!base=0, main_#t~mem8!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1015-L1019] COND TRUE !(main_#t~mem8 != { base: 0, offset: 0 }) [L1015] havoc main_#t~mem8; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1022] FCALL call main_#t~mem9 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1022] main_~y~0 := main_#t~mem9; [L1022] havoc main_#t~mem9; [L1023] FCALL call main_#t~malloc10 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1023] FCALL call write~$Pointer$(main_#t~malloc10, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1024] FCALL call write~int(1, { base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1025] FCALL call write~$Pointer$(main_~y~0, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1029] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1032] FCALL call main_#t~mem11 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_#t~mem11=1, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1032-L1035] COND TRUE !(1 != main_#t~mem11) [L1032] havoc main_#t~mem11; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1038] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1038] main_~x~0 := main_#t~mem13; [L1038] havoc main_#t~mem13; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1039-L1044] COND TRUE !(main_~x~0 != { base: 0, offset: 0 }) [L1047] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1048-L1053] COND FALSE !(!(main_~x~0 != { base: 0, offset: 0 })) [L1050] main_~head~0 := main_~x~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1051] FCALL call main_#t~mem16 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1051] main_~x~0 := main_#t~mem16; [L1051] havoc main_#t~mem16; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1052] assert 0 == main_~head~0!offset; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1052] assert 0 == main_~head~0!base || 1 == #valid[main_~head~0!base]; [L1052] FCALL call ULTIMATE.dealloc(main_~head~0); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L1048-L1053] COND TRUE !(main_~x~0 != { base: 0, offset: 0 }) [L1055] main_#res := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#res=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [L985-L1056] assert #valid == main_old_#valid; VAL [#NULL!base=0, #NULL!offset=0, main_#res=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc10!base=11, main_#t~malloc10!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=0, main_~x~0!offset=0, main_~y~0!base=0, main_~y~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L988] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L988] ~head~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L990] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L992] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L995-L1002] COND TRUE !(0 != #t~nondet1) [L995] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1005] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L1005-L1026] COND FALSE !(0 != #t~nondet4) [L1005] havoc #t~nondet4; [L1014] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1015] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1015-L1019] COND TRUE !(#t~mem8 != { base: 0, offset: 0 }) [L1015] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0] [L1022] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1022] ~y~0 := #t~mem9; [L1022] havoc #t~mem9; [L1023] FCALL call #t~malloc10 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0] [L1023] FCALL call write~$Pointer$(#t~malloc10, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1024] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1025] FCALL call write~$Pointer$(~y~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1029] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1032] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1032-L1035] COND TRUE !(1 != #t~mem11) [L1032] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0] [L1038] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1038] ~x~0 := #t~mem13; [L1038] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0] [L1039-L1044] COND TRUE !(~x~0 != { base: 0, offset: 0 }) [L1047] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1048-L1053] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0] [L1051] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1051] ~x~0 := #t~mem16; [L1051] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0] [L1052] assert 0 == ~head~0!offset; VAL [#NULL!base=0, #NULL!offset=0] [L1052] assert 0 == ~head~0!base || 1 == #valid[~head~0!base]; [L1052] FCALL call ULTIMATE.dealloc(~head~0); VAL [#NULL!base=0, #NULL!offset=0] [L1048-L1053] COND TRUE !(~x~0 != { base: 0, offset: 0 }) [L1055] #res := 0; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L988] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L988] ~head~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L990] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L992] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L995-L1002] COND TRUE !(0 != #t~nondet1) [L995] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1005] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L1005-L1026] COND FALSE !(0 != #t~nondet4) [L1005] havoc #t~nondet4; [L1014] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1015] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1015-L1019] COND TRUE !(#t~mem8 != { base: 0, offset: 0 }) [L1015] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0] [L1022] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1022] ~y~0 := #t~mem9; [L1022] havoc #t~mem9; [L1023] FCALL call #t~malloc10 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0] [L1023] FCALL call write~$Pointer$(#t~malloc10, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1024] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1025] FCALL call write~$Pointer$(~y~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1029] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1032] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1032-L1035] COND TRUE !(1 != #t~mem11) [L1032] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0] [L1038] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1038] ~x~0 := #t~mem13; [L1038] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0] [L1039-L1044] COND TRUE !(~x~0 != { base: 0, offset: 0 }) [L1047] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1048-L1053] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0] [L1051] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1051] ~x~0 := #t~mem16; [L1051] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0] [L1052] assert 0 == ~head~0!offset; VAL [#NULL!base=0, #NULL!offset=0] [L1052] assert 0 == ~head~0!base || 1 == #valid[~head~0!base]; [L1052] FCALL call ULTIMATE.dealloc(~head~0); VAL [#NULL!base=0, #NULL!offset=0] [L1048-L1053] COND TRUE !(~x~0 != { base: 0, offset: 0 }) [L1055] #res := 0; VAL [#NULL!base=0, #NULL!offset=0] [L988] SLL* head = malloc(sizeof(SLL)); [L989] head->next = ((void*)0) [L990] head->data = 0 [L992] SLL* x = head; [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x = head [L1015] x->next [L1015] COND FALSE !(x->next) [L1022] EXPR x->next [L1022] SLL* y = x->next; [L1023] x->next = malloc(sizeof(SLL)) [L1024] x->data = 1 [L1025] x->next = y [L1029] x = head [L1032] EXPR x->data [L1032] COND FALSE !(x->data != 1) [L1038] EXPR x->next [L1038] x = x->next [L1039] COND FALSE !(\read(*x)) [L1047] x = head [L1048] COND TRUE x != ((void*)0) [L1050] head = x [L1051] EXPR x->next [L1051] x = x->next [L1052] free(head) [L1052] free(head) [L1048] COND FALSE !(x != ((void*)0)) [L1055] return 0; ----- [2018-11-23 14:49:06,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:49:06 ImpRootNode [2018-11-23 14:49:06,390 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 14:49:06,390 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:49:06,390 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:49:06,390 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:49:06,391 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:12" (3/4) ... [2018-11-23 14:49:06,406 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:49:06,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:49:06,407 INFO L168 Benchmark]: Toolchain (without parser) took 175167.17 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 955.4 MB in the beginning and 1.7 GB in the end (delta: -782.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-23 14:49:06,413 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:49:06,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:06,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.83 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:06,414 INFO L168 Benchmark]: Boogie Preprocessor took 23.53 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:06,414 INFO L168 Benchmark]: RCFGBuilder took 427.03 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:06,414 INFO L168 Benchmark]: CodeCheck took 174339.58 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -707.3 MB). Peak memory consumption was 949.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:06,415 INFO L168 Benchmark]: Witness Printer took 15.89 ms. Allocated memory is still 2.8 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:06,417 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 94 locations, 43 error locations. UNSAFE Result, 174.2s OverallTime, 98 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 458752 SDtfs, -1372242712 SDslu, 613774944 SDs, 0 SdLazy, -124866198 SolverSat, -1962278506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 80.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14423 GetRequests, 12704 SyntacticMatches, 571 SemanticMatches, 1148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721128 ImplicationChecksByTransitivity, 170.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1521 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 1400 ConstructedInterpolants, 0 QuantifiedInterpolants, 157993 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 75 PerfectInterpolantSequences, 45/113 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L988] SLL* head = malloc(sizeof(SLL)); [L989] head->next = ((void*)0) [L990] head->data = 0 [L992] SLL* x = head; [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x = head [L1015] x->next [L1015] COND FALSE !(x->next) [L1022] EXPR x->next [L1022] SLL* y = x->next; [L1023] x->next = malloc(sizeof(SLL)) [L1024] x->data = 1 [L1025] x->next = y [L1029] x = head [L1032] EXPR x->data [L1032] COND FALSE !(x->data != 1) [L1038] EXPR x->next [L1038] x = x->next [L1039] COND FALSE !(\read(*x)) [L1047] x = head [L1048] COND TRUE x != ((void*)0) [L1050] head = x [L1051] EXPR x->next [L1051] x = x->next [L1052] free(head) [L1052] free(head) [L1048] COND FALSE !(x != ((void*)0)) [L1055] return 0; * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.83 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.53 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 427.03 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. * CodeCheck took 174339.58 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -707.3 MB). Peak memory consumption was 949.5 MB. Max. memory is 11.5 GB. * Witness Printer took 15.89 ms. Allocated memory is still 2.8 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 14:49:07,829 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:49:07,830 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:49:07,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:49:07,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:49:07,838 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:49:07,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:49:07,839 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:49:07,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:49:07,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:49:07,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:49:07,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:49:07,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:49:07,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:49:07,844 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:49:07,845 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:49:07,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:49:07,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:49:07,848 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:49:07,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:49:07,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:49:07,851 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:49:07,853 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:49:07,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:49:07,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:49:07,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:49:07,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:49:07,855 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:49:07,856 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:49:07,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:49:07,857 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:49:07,858 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:49:07,858 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:49:07,858 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:49:07,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:49:07,859 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:49:07,860 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf [2018-11-23 14:49:07,870 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:49:07,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:49:07,871 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:49:07,872 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:49:07,872 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:49:07,872 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:49:07,872 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:49:07,872 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:49:07,872 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:49:07,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:49:07,873 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 14:49:07,873 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 14:49:07,873 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 14:49:07,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:49:07,873 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 14:49:07,873 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 14:49:07,873 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:49:07,873 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:49:07,873 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 14:49:07,874 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 14:49:07,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:49:07,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:49:07,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 14:49:07,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:49:07,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:49:07,874 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 14:49:07,874 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 14:49:07,874 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:49:07,875 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 14:49:07,875 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak 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 -> Kojak 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 -> 5a3a274b64e7ba6d81948d0b8c45cbd715251888 [2018-11-23 14:49:07,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:49:07,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:49:07,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:49:07,919 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:49:07,920 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:49:07,920 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 14:49:07,959 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/data/74ed8d9a1/e9b26ac3ff404addab09d8d90ce8c95a/FLAG190816d45 [2018-11-23 14:49:08,325 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:49:08,325 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 14:49:08,334 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/data/74ed8d9a1/e9b26ac3ff404addab09d8d90ce8c95a/FLAG190816d45 [2018-11-23 14:49:08,721 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/data/74ed8d9a1/e9b26ac3ff404addab09d8d90ce8c95a [2018-11-23 14:49:08,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:49:08,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:49:08,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:49:08,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:49:08,728 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:49:08,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:49:08" (1/1) ... [2018-11-23 14:49:08,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e37990a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08, skipping insertion in model container [2018-11-23 14:49:08,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:49:08" (1/1) ... [2018-11-23 14:49:08,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:49:08,766 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:49:08,971 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:49:08,980 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:49:09,015 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:49:09,048 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:49:09,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:09 WrapperNode [2018-11-23 14:49:09,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:49:09,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:49:09,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:49:09,050 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:49:09,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:09" (1/1) ... [2018-11-23 14:49:09,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:09" (1/1) ... [2018-11-23 14:49:09,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:49:09,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:49:09,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:49:09,136 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:49:09,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:09" (1/1) ... [2018-11-23 14:49:09,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:09" (1/1) ... [2018-11-23 14:49:09,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:09" (1/1) ... [2018-11-23 14:49:09,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:09" (1/1) ... [2018-11-23 14:49:09,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:09" (1/1) ... [2018-11-23 14:49:09,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:09" (1/1) ... [2018-11-23 14:49:09,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:09" (1/1) ... [2018-11-23 14:49:09,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:49:09,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:49:09,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:49:09,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:49:09,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8d347b3-eb03-4b7a-b23b-688c4c49c394/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 14:49:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:49:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 14:49:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 14:49:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 14:49:09,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:49:09,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 14:49:09,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:49:09,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:49:09,753 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:49:09,753 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 14:49:09,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:49:09 BoogieIcfgContainer [2018-11-23 14:49:09,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:49:09,754 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 14:49:09,754 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 14:49:09,760 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 14:49:09,760 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:49:09" (1/1) ... [2018-11-23 14:49:09,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:49:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:49:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 79 states and 90 transitions. [2018-11-23 14:49:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-11-23 14:49:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-11-23 14:49:09,789 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:49:09,820 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.IllegalArgumentException: Indexed Sort BitVec undefined at de.uni_freiburg.informatik.ultimate.logic.SortSymbol.checkArity(SortSymbol.java:153) at de.uni_freiburg.informatik.ultimate.logic.SortSymbol.getSort(SortSymbol.java:177) at de.uni_freiburg.informatik.ultimate.logic.Theory.getSort(Theory.java:1243) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:287) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.TermTransferrer.transferSort(TermTransferrer.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.TermTransferrer.convertApplicationTerm(TermTransferrer.java:162) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:320) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.SmtSymbols.transferSymbols(SmtSymbols.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:449) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 14:49:09,822 INFO L168 Benchmark]: Toolchain (without parser) took 1097.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:09,823 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:49:09,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.86 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:09,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 922.9 MB in the beginning and 1.2 GB in the end (delta: -227.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:09,824 INFO L168 Benchmark]: Boogie Preprocessor took 25.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:09,825 INFO L168 Benchmark]: RCFGBuilder took 592.27 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: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:09,825 INFO L168 Benchmark]: CodeCheck took 67.75 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.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:49:09,827 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: IllegalArgumentException: Indexed Sort BitVec undefined de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: IllegalArgumentException: Indexed Sort BitVec undefined: de.uni_freiburg.informatik.ultimate.logic.SortSymbol.checkArity(SortSymbol.java:153) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.86 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 922.9 MB in the beginning and 1.2 GB in the end (delta: -227.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 592.27 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: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * CodeCheck took 67.75 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.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...