./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-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_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/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 a0270bdb02afc11bd88836e5502a475e981de345 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/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 a0270bdb02afc11bd88836e5502a475e981de345 .................................................................................................................................................................................................................... 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 05:14:53,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:14:53,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:14:53,223 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:14:53,224 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:14:53,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:14:53,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:14:53,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:14:53,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:14:53,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:14:53,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:14:53,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:14:53,229 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:14:53,230 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:14:53,231 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:14:53,231 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:14:53,232 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:14:53,233 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:14:53,234 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:14:53,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:14:53,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:14:53,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:14:53,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:14:53,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:14:53,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:14:53,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:14:53,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:14:53,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:14:53,242 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:14:53,242 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:14:53,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:14:53,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:14:53,243 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:14:53,243 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:14:53,244 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:14:53,245 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:14:53,245 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-23 05:14:53,256 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:14:53,256 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:14:53,257 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:14:53,257 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:14:53,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:14:53,257 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:14:53,257 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:14:53,257 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:14:53,258 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:14:53,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:14:53,258 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 05:14:53,258 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 05:14:53,258 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 05:14:53,258 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:14:53,258 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:14:53,259 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:14:53,259 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 05:14:53,259 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 05:14:53,259 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:14:53,259 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:14:53,259 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 05:14:53,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:14:53,260 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:14:53,260 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 05:14:53,260 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:14:53,260 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_bc0874c3-74cd-4a2d-89a6-748a356923f3/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 -> a0270bdb02afc11bd88836e5502a475e981de345 [2018-11-23 05:14:53,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:14:53,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:14:53,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:14:53,296 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:14:53,296 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:14:53,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/../../sv-benchmarks/c/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 05:14:53,331 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/data/62093a848/26a87838c72a43c2886538592f27ae35/FLAG978a4c8f1 [2018-11-23 05:14:53,671 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:14:53,672 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/sv-benchmarks/c/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 05:14:53,679 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/data/62093a848/26a87838c72a43c2886538592f27ae35/FLAG978a4c8f1 [2018-11-23 05:14:53,689 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/data/62093a848/26a87838c72a43c2886538592f27ae35 [2018-11-23 05:14:53,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:14:53,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:14:53,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:14:53,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:14:53,695 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:14:53,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:14:53" (1/1) ... [2018-11-23 05:14:53,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7befe0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:53, skipping insertion in model container [2018-11-23 05:14:53,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:14:53" (1/1) ... [2018-11-23 05:14:53,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:14:53,731 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:14:53,923 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:14:53,930 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:14:54,014 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:14:54,038 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:14:54,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:54 WrapperNode [2018-11-23 05:14:54,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:14:54,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:14:54,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:14:54,039 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:14:54,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:54" (1/1) ... [2018-11-23 05:14:54,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:54" (1/1) ... [2018-11-23 05:14:54,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:14:54,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:14:54,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:14:54,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:14:54,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:54" (1/1) ... [2018-11-23 05:14:54,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:54" (1/1) ... [2018-11-23 05:14:54,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:54" (1/1) ... [2018-11-23 05:14:54,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:54" (1/1) ... [2018-11-23 05:14:54,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:54" (1/1) ... [2018-11-23 05:14:54,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:54" (1/1) ... [2018-11-23 05:14:54,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:54" (1/1) ... [2018-11-23 05:14:54,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:14:54,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:14:54,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:14:54,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:14:54,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:14:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/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 05:14:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:14:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:14:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:14:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 05:14:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 05:14:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:14:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:14:54,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:14:54,570 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:14:54,571 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 05:14:54,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:14:54 BoogieIcfgContainer [2018-11-23 05:14:54,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:14:54,572 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 05:14:54,572 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 05:14:54,579 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 05:14:54,579 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:14:54" (1/1) ... [2018-11-23 05:14:54,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 103 states and 116 transitions. [2018-11-23 05:14:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-11-23 05:14:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-11-23 05:14:54,613 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:54,695 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 05:14:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 102 states and 115 transitions. [2018-11-23 05:14:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2018-11-23 05:14:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-11-23 05:14:54,731 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:54,766 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 05:14:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 101 states and 114 transitions. [2018-11-23 05:14:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-11-23 05:14:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 05:14:54,840 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:54,855 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 05:14:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 100 states and 113 transitions. [2018-11-23 05:14:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-11-23 05:14:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 05:14:54,868 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:54,887 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 05:14:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 99 states and 112 transitions. [2018-11-23 05:14:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2018-11-23 05:14:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 05:14:54,897 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:54,915 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 05:14:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 98 states and 111 transitions. [2018-11-23 05:14:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-11-23 05:14:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 05:14:54,942 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:54,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 05:14:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 97 states and 110 transitions. [2018-11-23 05:14:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-11-23 05:14:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 05:14:54,994 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:55,041 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 05:14:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 96 states and 108 transitions. [2018-11-23 05:14:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-11-23 05:14:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 05:14:55,071 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:55,142 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 05:14:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 99 states and 113 transitions. [2018-11-23 05:14:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-11-23 05:14:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 05:14:55,235 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:55,251 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 05:14:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 98 states and 112 transitions. [2018-11-23 05:14:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-11-23 05:14:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 05:14:55,264 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:14:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 97 states and 111 transitions. [2018-11-23 05:14:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2018-11-23 05:14:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 05:14:55,478 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:55,510 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 05:14:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 96 states and 110 transitions. [2018-11-23 05:14:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2018-11-23 05:14:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 05:14:55,521 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:55,555 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 05:14:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 95 states and 109 transitions. [2018-11-23 05:14:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-11-23 05:14:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 05:14:55,563 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:14:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 100 states and 118 transitions. [2018-11-23 05:14:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2018-11-23 05:14:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 05:14:55,693 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:55,753 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 05:14:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 105 states and 128 transitions. [2018-11-23 05:14:55,854 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2018-11-23 05:14:55,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 05:14:55,855 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:55,968 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 05:14:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 107 states and 131 transitions. [2018-11-23 05:14:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2018-11-23 05:14:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 05:14:56,194 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:56,325 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 05:14:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 109 states and 134 transitions. [2018-11-23 05:14:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2018-11-23 05:14:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:14:56,775 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:56,813 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 05:14:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 108 states and 133 transitions. [2018-11-23 05:14:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2018-11-23 05:14:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:14:56,822 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:56,871 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 05:14:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 107 states and 132 transitions. [2018-11-23 05:14:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2018-11-23 05:14:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:14:57,030 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:57,037 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 05:14:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 108 states and 134 transitions. [2018-11-23 05:14:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2018-11-23 05:14:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:14:57,157 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:57,172 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 05:14:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 109 states and 135 transitions. [2018-11-23 05:14:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2018-11-23 05:14:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:14:57,366 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:57,381 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 05:14:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 108 states and 134 transitions. [2018-11-23 05:14:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2018-11-23 05:14:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:14:57,389 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:57,401 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 05:14:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 107 states and 133 transitions. [2018-11-23 05:14:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2018-11-23 05:14:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:14:57,429 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:57,436 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 05:14:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 108 states and 135 transitions. [2018-11-23 05:14:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 135 transitions. [2018-11-23 05:14:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:14:57,443 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:57,465 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 05:14:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 109 states and 136 transitions. [2018-11-23 05:14:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 136 transitions. [2018-11-23 05:14:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:14:57,475 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:57,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 05:14:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 113 states and 143 transitions. [2018-11-23 05:14:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions. [2018-11-23 05:14:58,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:14:58,354 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:58,560 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 05:14:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 115 states and 147 transitions. [2018-11-23 05:14:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 147 transitions. [2018-11-23 05:14:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:14:58,944 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:58,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 05:14:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 114 states and 146 transitions. [2018-11-23 05:14:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2018-11-23 05:14:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:14:58,973 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:59,009 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 05:14:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 117 states and 151 transitions. [2018-11-23 05:14:59,105 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2018-11-23 05:14:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:14:59,105 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:59,159 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 05:14:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 116 states and 149 transitions. [2018-11-23 05:14:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2018-11-23 05:14:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:14:59,165 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:59,172 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 05:14:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 113 states and 146 transitions. [2018-11-23 05:14:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2018-11-23 05:14:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:14:59,235 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:59,242 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 05:14:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 112 states and 145 transitions. [2018-11-23 05:14:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2018-11-23 05:14:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:14:59,250 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:59,258 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 05:14:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 111 states and 144 transitions. [2018-11-23 05:14:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2018-11-23 05:14:59,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:14:59,269 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:59,276 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 05:14:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 110 states and 143 transitions. [2018-11-23 05:14:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 143 transitions. [2018-11-23 05:14:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:14:59,298 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:59,539 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 05:14:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 111 states and 145 transitions. [2018-11-23 05:14:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2018-11-23 05:14:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:14:59,750 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:59,774 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 05:14:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:14:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 113 states and 149 transitions. [2018-11-23 05:14:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 149 transitions. [2018-11-23 05:14:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:14:59,795 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:14:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:59,857 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 05:15:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 115 states and 154 transitions. [2018-11-23 05:15:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2018-11-23 05:15:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:15:00,016 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:00,022 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 05:15:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 114 states and 153 transitions. [2018-11-23 05:15:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 153 transitions. [2018-11-23 05:15:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:15:00,030 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:00,063 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 05:15:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 115 states and 154 transitions. [2018-11-23 05:15:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2018-11-23 05:15:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:15:00,076 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:00,356 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 05:15:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 121 states and 164 transitions. [2018-11-23 05:15:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions. [2018-11-23 05:15:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 05:15:01,314 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:01,323 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 05:15:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 120 states and 163 transitions. [2018-11-23 05:15:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 163 transitions. [2018-11-23 05:15:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 05:15:01,354 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:01,409 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 05:15:01,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 121 states and 164 transitions. [2018-11-23 05:15:01,461 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions. [2018-11-23 05:15:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 05:15:01,462 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:01,468 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 05:15:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 120 states and 163 transitions. [2018-11-23 05:15:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 163 transitions. [2018-11-23 05:15:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 05:15:01,485 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:01,504 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 05:15:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 122 states and 167 transitions. [2018-11-23 05:15:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 167 transitions. [2018-11-23 05:15:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 05:15:01,512 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:01,519 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 05:15:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 121 states and 166 transitions. [2018-11-23 05:15:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 166 transitions. [2018-11-23 05:15:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 05:15:01,526 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:01,545 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 05:15:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 122 states and 169 transitions. [2018-11-23 05:15:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 169 transitions. [2018-11-23 05:15:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 05:15:01,554 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:01,710 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 05:15:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 98 states and 131 transitions. [2018-11-23 05:15:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 131 transitions. [2018-11-23 05:15:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:15:01,726 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:01,910 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 05:15:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 105 states and 144 transitions. [2018-11-23 05:15:02,660 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2018-11-23 05:15:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:15:02,660 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:02,827 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 05:15:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 112 states and 157 transitions. [2018-11-23 05:15:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2018-11-23 05:15:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:15:03,721 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:03,874 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 05:15:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 117 states and 163 transitions. [2018-11-23 05:15:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2018-11-23 05:15:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:15:04,747 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:04,816 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 05:15:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 120 states and 169 transitions. [2018-11-23 05:15:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2018-11-23 05:15:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:15:04,846 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:04,938 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 05:15:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 123 states and 175 transitions. [2018-11-23 05:15:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2018-11-23 05:15:04,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:15:04,962 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:05,137 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 05:15:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 130 states and 185 transitions. [2018-11-23 05:15:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 185 transitions. [2018-11-23 05:15:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:15:06,719 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:07,009 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 05:15:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 139 states and 201 transitions. [2018-11-23 05:15:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2018-11-23 05:15:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:15:09,067 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:09,365 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 05:15:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 152 states and 222 transitions. [2018-11-23 05:15:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 222 transitions. [2018-11-23 05:15:12,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:15:12,648 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:12,666 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 05:15:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 154 states and 224 transitions. [2018-11-23 05:15:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2018-11-23 05:15:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 05:15:13,006 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:13,039 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 05:15:14,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 160 states and 242 transitions. [2018-11-23 05:15:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2018-11-23 05:15:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 05:15:14,090 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:14,113 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 05:15:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 166 states and 258 transitions. [2018-11-23 05:15:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 258 transitions. [2018-11-23 05:15:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 05:15:15,115 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:15,308 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 05:15:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 172 states and 273 transitions. [2018-11-23 05:15:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 273 transitions. [2018-11-23 05:15:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:15:18,148 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:18,154 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 05:15:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 173 states and 274 transitions. [2018-11-23 05:15:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 274 transitions. [2018-11-23 05:15:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:15:18,176 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:18,403 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 05:15:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 175 states and 284 transitions. [2018-11-23 05:15:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 284 transitions. [2018-11-23 05:15:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:15:18,516 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:18,544 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 05:15:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 176 states and 285 transitions. [2018-11-23 05:15:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-11-23 05:15:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:15:18,862 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:19,612 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 05:15:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 179 states and 292 transitions. [2018-11-23 05:15:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 292 transitions. [2018-11-23 05:15:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 05:15:22,719 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:22,737 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 05:15:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 181 states and 297 transitions. [2018-11-23 05:15:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 297 transitions. [2018-11-23 05:15:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 05:15:23,428 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:23,936 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 05:15:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 185 states and 310 transitions. [2018-11-23 05:15:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 310 transitions. [2018-11-23 05:15:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 05:15:26,229 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:26,623 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 05:15:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 188 states and 317 transitions. [2018-11-23 05:15:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 317 transitions. [2018-11-23 05:15:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 05:15:28,154 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:28,514 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 05:15:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 190 states and 324 transitions. [2018-11-23 05:15:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 324 transitions. [2018-11-23 05:15:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 05:15:29,422 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:30,684 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 05:15:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 198 states and 338 transitions. [2018-11-23 05:15:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 338 transitions. [2018-11-23 05:15:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:15:36,482 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:36,489 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 05:15:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 195 states and 331 transitions. [2018-11-23 05:15:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 331 transitions. [2018-11-23 05:15:36,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:15:36,493 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:38,170 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 05:15:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 207 states and 365 transitions. [2018-11-23 05:15:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 365 transitions. [2018-11-23 05:15:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:15:45,924 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:46,720 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 05:15:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 208 states and 368 transitions. [2018-11-23 05:15:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 368 transitions. [2018-11-23 05:15:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:15:47,217 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:48,063 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 05:15:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 213 states and 384 transitions. [2018-11-23 05:15:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 384 transitions. [2018-11-23 05:15:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:15:52,072 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:52,206 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 05:15:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 217 states and 396 transitions. [2018-11-23 05:15:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 396 transitions. [2018-11-23 05:15:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:15:54,659 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:54,797 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 05:15:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:15:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 219 states and 401 transitions. [2018-11-23 05:15:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 401 transitions. [2018-11-23 05:15:56,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:15:56,126 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:15:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:57,213 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 05:16:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 222 states and 409 transitions. [2018-11-23 05:16:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 409 transitions. [2018-11-23 05:16:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:16:00,899 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:02,175 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 05:16:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 232 states and 435 transitions. [2018-11-23 05:16:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 435 transitions. [2018-11-23 05:16:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:16:08,312 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:09,472 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 05:16:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 242 states and 461 transitions. [2018-11-23 05:16:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 461 transitions. [2018-11-23 05:16:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:16:15,318 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:15,344 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 05:16:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 243 states and 463 transitions. [2018-11-23 05:16:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 463 transitions. [2018-11-23 05:16:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:16:15,909 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:15,957 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 05:16:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 249 states and 472 transitions. [2018-11-23 05:16:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 472 transitions. [2018-11-23 05:16:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:16:19,068 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:19,087 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 05:16:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 255 states and 483 transitions. [2018-11-23 05:16:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 483 transitions. [2018-11-23 05:16:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:16:21,924 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:21,948 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 05:16:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 256 states and 485 transitions. [2018-11-23 05:16:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 485 transitions. [2018-11-23 05:16:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:22,566 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:22,585 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 05:16:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 259 states and 493 transitions. [2018-11-23 05:16:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 493 transitions. [2018-11-23 05:16:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:23,891 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:23,931 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 05:16:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 263 states and 503 transitions. [2018-11-23 05:16:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 503 transitions. [2018-11-23 05:16:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:25,959 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:25,973 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 05:16:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 264 states and 506 transitions. [2018-11-23 05:16:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 506 transitions. [2018-11-23 05:16:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:26,564 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:26,608 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 05:16:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 265 states and 510 transitions. [2018-11-23 05:16:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 510 transitions. [2018-11-23 05:16:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:27,088 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:27,101 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 05:16:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 266 states and 513 transitions. [2018-11-23 05:16:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 513 transitions. [2018-11-23 05:16:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:27,571 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:27,579 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 05:16:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 269 states and 517 transitions. [2018-11-23 05:16:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 517 transitions. [2018-11-23 05:16:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:28,683 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:29,004 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 05:16:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 278 states and 543 transitions. [2018-11-23 05:16:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 543 transitions. [2018-11-23 05:16:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:36,144 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:36,201 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 05:16:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 279 states and 545 transitions. [2018-11-23 05:16:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 545 transitions. [2018-11-23 05:16:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:36,702 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:37,320 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 05:16:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 291 states and 566 transitions. [2018-11-23 05:16:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 566 transitions. [2018-11-23 05:16:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:46,272 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:16:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 302 states and 588 transitions. [2018-11-23 05:16:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 588 transitions. [2018-11-23 05:16:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:52,616 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:52,678 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 05:16:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 308 states and 612 transitions. [2018-11-23 05:16:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 612 transitions. [2018-11-23 05:16:56,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:56,592 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:56,778 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 05:16:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 309 states and 616 transitions. [2018-11-23 05:16:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 616 transitions. [2018-11-23 05:16:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:57,347 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:57,353 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 05:16:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:16:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 313 states and 630 transitions. [2018-11-23 05:16:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 630 transitions. [2018-11-23 05:16:59,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:16:59,678 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:16:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 316 states and 635 transitions. [2018-11-23 05:17:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 635 transitions. [2018-11-23 05:17:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:17:02,137 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:02,216 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 05:17:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 320 states and 648 transitions. [2018-11-23 05:17:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 648 transitions. [2018-11-23 05:17:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:17:05,708 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:05,714 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 05:17:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 321 states and 650 transitions. [2018-11-23 05:17:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 650 transitions. [2018-11-23 05:17:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:17:06,429 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:06,614 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 05:17:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 323 states and 655 transitions. [2018-11-23 05:17:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 655 transitions. [2018-11-23 05:17:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:17:08,444 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:08,507 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 05:17:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 324 states and 658 transitions. [2018-11-23 05:17:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 658 transitions. [2018-11-23 05:17:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:17:09,413 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:09,516 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 05:17:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 327 states and 672 transitions. [2018-11-23 05:17:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 672 transitions. [2018-11-23 05:17:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:17:11,152 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:11,158 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 05:17:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 328 states and 677 transitions. [2018-11-23 05:17:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 677 transitions. [2018-11-23 05:17:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:17:11,880 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:12,383 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 05:17:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 333 states and 685 transitions. [2018-11-23 05:17:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 685 transitions. [2018-11-23 05:17:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 05:17:14,302 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:14,322 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 05:17:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 333 states and 684 transitions. [2018-11-23 05:17:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 684 transitions. [2018-11-23 05:17:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 05:17:15,065 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:17,250 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 05:17:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 346 states and 711 transitions. [2018-11-23 05:17:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 711 transitions. [2018-11-23 05:17:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 05:17:28,489 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:28,494 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 05:17:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 346 states and 710 transitions. [2018-11-23 05:17:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 710 transitions. [2018-11-23 05:17:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:17:29,286 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:17:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 347 states and 713 transitions. [2018-11-23 05:17:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 713 transitions. [2018-11-23 05:17:30,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:17:30,822 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:32,632 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 05:17:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 353 states and 723 transitions. [2018-11-23 05:17:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 723 transitions. [2018-11-23 05:17:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:17:36,027 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:37,606 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 05:17:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 359 states and 732 transitions. [2018-11-23 05:17:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 732 transitions. [2018-11-23 05:17:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:17:42,438 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:17:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 369 states and 753 transitions. [2018-11-23 05:17:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 753 transitions. [2018-11-23 05:17:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:17:56,446 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:17:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:18:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 373 states and 761 transitions. [2018-11-23 05:18:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 761 transitions. [2018-11-23 05:18:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:18:02,314 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 05:18:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 377 states and 765 transitions. [2018-11-23 05:18:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 765 transitions. [2018-11-23 05:18:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:06,624 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:07,188 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 05:18:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:09,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 380 states and 773 transitions. [2018-11-23 05:18:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 773 transitions. [2018-11-23 05:18:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:09,543 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:12,943 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 05:18:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 388 states and 798 transitions. [2018-11-23 05:18:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 798 transitions. [2018-11-23 05:18:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:24,131 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:24,648 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 05:18:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 389 states and 801 transitions. [2018-11-23 05:18:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 801 transitions. [2018-11-23 05:18:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:25,724 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:27,754 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 05:18:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 397 states and 824 transitions. [2018-11-23 05:18:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 824 transitions. [2018-11-23 05:18:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:36,926 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:36,985 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 05:18:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 398 states and 831 transitions. [2018-11-23 05:18:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 831 transitions. [2018-11-23 05:18:38,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:38,290 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:38,457 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 05:18:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 399 states and 838 transitions. [2018-11-23 05:18:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 838 transitions. [2018-11-23 05:18:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:39,806 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:39,868 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 05:18:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 400 states and 842 transitions. [2018-11-23 05:18:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 842 transitions. [2018-11-23 05:18:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:41,155 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:41,261 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 05:18:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 401 states and 846 transitions. [2018-11-23 05:18:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 846 transitions. [2018-11-23 05:18:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:42,596 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:43,120 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 05:18:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 402 states and 849 transitions. [2018-11-23 05:18:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 849 transitions. [2018-11-23 05:18:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:44,142 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:44,213 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 05:18:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 403 states and 853 transitions. [2018-11-23 05:18:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 853 transitions. [2018-11-23 05:18:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:45,362 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:45,472 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 05:18:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 404 states and 857 transitions. [2018-11-23 05:18:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 857 transitions. [2018-11-23 05:18:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:46,687 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:46,745 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 05:18:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 407 states and 867 transitions. [2018-11-23 05:18:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 867 transitions. [2018-11-23 05:18:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:18:49,874 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:18:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:18:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:18:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:18:49,979 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 123 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~mem4.base, main_#t~mem4.offset, main_#t~nondet1, main_#t~nondet5, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet8, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_~y~0.base, main_~y~0.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.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(12);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: L990 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, 4 + main_~head~0.offset, 4); srcloc: L990-1 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, 8 + 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~nondet5 && main_#t~nondet5 <= 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~nondet5|=0] [?] assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;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~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); srcloc: L1019-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~mem7.base|=0, |ULTIMATE.start_main_#t~mem7.offset|=0] [?] assume !(main_#t~mem7.base != 0 || main_#t~mem7.offset != 0);havoc main_#t~mem7.base, main_#t~mem7.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~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~y~0.base, main_~y~0.offset := main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(12); 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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.offset|=0] [?] SUMMARY for call write~$Pointer$(main_#t~malloc11.base, main_#t~malloc11.offset, main_~x~0.base, main_~x~0.offset, 4); srcloc: L1027 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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.offset|=0] [?] SUMMARY for call write~int(1, main_~x~0.base, 8 + main_~x~0.offset, 4); srcloc: L1027-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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.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: L1028 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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.offset|=0] [?] assume !(main_~y~0.base != 0 || main_~y~0.offset != 0); 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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.offset|=0] [?] SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, 8 + main_~x~0.offset, 4); srcloc: L1041-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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.offset|=0, |ULTIMATE.start_main_#t~mem13|=1] [?] assume !(1 != main_#t~mem13);havoc main_#t~mem13; 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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.offset|=0] [?] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem15.base, main_#t~mem15.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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.offset|=0] [?] call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem18.base, main_#t~mem18.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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.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~malloc11.base|=11, |ULTIMATE.start_main_#t~malloc11.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~mem4.base, main_#t~mem4.offset, main_#t~nondet1, main_#t~nondet5, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet8, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_~y~0.base, main_~y~0.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset; [L989] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L989] 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] [L990] 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] [L991] call write~$Pointer$(0, 0, main_~head~0.base, 4 + 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] [L992] call write~int(0, main_~head~0.base, 8 + main_~head~0.offset, 4); [L994] 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] [L997] 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] [L997-L1005] assume !(0 != main_#t~nondet1); [L997] 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] [L1008] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet5=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1008-L1035] assume !(0 != main_#t~nondet5); [L1008] havoc main_#t~nondet5; [L1018] 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] [L1019] call main_#t~mem7.base, main_#t~mem7.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~mem7.base=0, main_#t~mem7.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1019-L1023] assume !(main_#t~mem7.base != 0 || main_#t~mem7.offset != 0); [L1019] havoc main_#t~mem7.base, main_#t~mem7.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] [L1026] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1026] main_~y~0.base, main_~y~0.offset := main_#t~mem10.base, main_#t~mem10.offset; [L1026] havoc main_#t~mem10.base, main_#t~mem10.offset; [L1027] call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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] [L1027] call write~$Pointer$(main_#t~malloc11.base, main_#t~malloc11.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~malloc11.base=11, main_#t~malloc11.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] [L1028] call write~int(1, main_~x~0.base, 8 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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] 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~malloc11.base=11, main_#t~malloc11.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] [L1030-L1034] assume !(main_~y~0.base != 0 || main_~y~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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] 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~malloc11.base=11, main_#t~malloc11.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] [L1041] call main_#t~mem13 := read~int(main_~x~0.base, 8 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.offset=0, main_#t~mem13=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] [L1041-L1044] assume !(1 != main_#t~mem13); [L1041] havoc main_#t~mem13; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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] [L1047] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1047] main_~x~0.base, main_~x~0.offset := main_#t~mem15.base, main_#t~mem15.offset; [L1047] havoc main_#t~mem15.base, main_#t~mem15.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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); [L1056] 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~malloc11.base=11, main_#t~malloc11.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] [L1057-L1062] assume !!(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1059] 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~malloc11.base=11, main_#t~malloc11.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] [L1060] call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1060] main_~x~0.base, main_~x~0.offset := main_#t~mem18.base, main_#t~mem18.offset; [L1060] havoc main_#t~mem18.base, main_#t~mem18.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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] [L1061] 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~malloc11.base=11, main_#t~malloc11.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] [L1061] assert 0 == main_~head~0.base || 1 == #valid[main_~head~0.base]; [L1061] 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~malloc11.base=11, main_#t~malloc11.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] [L1057-L1062] assume !(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1064] 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~malloc11.base=11, main_#t~malloc11.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] [L986-L1065] 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~malloc11.base=11, main_#t~malloc11.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~mem4.base, main_#t~mem4.offset, main_#t~nondet1, main_#t~nondet5, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet8, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_~y~0.base, main_~y~0.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset; [L989] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L989] 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] [L990] 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] [L991] call write~$Pointer$(0, 0, main_~head~0.base, 4 + 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] [L992] call write~int(0, main_~head~0.base, 8 + main_~head~0.offset, 4); [L994] 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] [L997] 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] [L997-L1005] assume !(0 != main_#t~nondet1); [L997] 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] [L1008] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet5=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1008-L1035] assume !(0 != main_#t~nondet5); [L1008] havoc main_#t~nondet5; [L1018] 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] [L1019] call main_#t~mem7.base, main_#t~mem7.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~mem7.base=0, main_#t~mem7.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1019-L1023] assume !(main_#t~mem7.base != 0 || main_#t~mem7.offset != 0); [L1019] havoc main_#t~mem7.base, main_#t~mem7.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] [L1026] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1026] main_~y~0.base, main_~y~0.offset := main_#t~mem10.base, main_#t~mem10.offset; [L1026] havoc main_#t~mem10.base, main_#t~mem10.offset; [L1027] call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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] [L1027] call write~$Pointer$(main_#t~malloc11.base, main_#t~malloc11.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~malloc11.base=11, main_#t~malloc11.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] [L1028] call write~int(1, main_~x~0.base, 8 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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] 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~malloc11.base=11, main_#t~malloc11.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] [L1030-L1034] assume !(main_~y~0.base != 0 || main_~y~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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] 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~malloc11.base=11, main_#t~malloc11.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] [L1041] call main_#t~mem13 := read~int(main_~x~0.base, 8 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.offset=0, main_#t~mem13=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] [L1041-L1044] assume !(1 != main_#t~mem13); [L1041] havoc main_#t~mem13; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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] [L1047] call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1047] main_~x~0.base, main_~x~0.offset := main_#t~mem15.base, main_#t~mem15.offset; [L1047] havoc main_#t~mem15.base, main_#t~mem15.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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); [L1056] 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~malloc11.base=11, main_#t~malloc11.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] [L1057-L1062] assume !!(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1059] 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~malloc11.base=11, main_#t~malloc11.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] [L1060] call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1060] main_~x~0.base, main_~x~0.offset := main_#t~mem18.base, main_#t~mem18.offset; [L1060] havoc main_#t~mem18.base, main_#t~mem18.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc11.base=11, main_#t~malloc11.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] [L1061] 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~malloc11.base=11, main_#t~malloc11.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] [L1061] assert 0 == main_~head~0.base || 1 == #valid[main_~head~0.base]; [L1061] 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~malloc11.base=11, main_#t~malloc11.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] [L1057-L1062] assume !(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1064] 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~malloc11.base=11, main_#t~malloc11.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] [L986-L1065] 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~malloc11.base=11, main_#t~malloc11.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~mem4, main_#t~nondet1, main_#t~nondet5, main_#t~malloc6, main_#t~nondet8, main_#t~mem9, main_#t~mem7, main_#t~mem10, main_#t~malloc11, main_#t~mem12, main_~y~0, main_#t~mem14, main_#t~mem13, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_~head~0, main_~x~0; [L989] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L989] 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] [L990] 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] [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~head~0!base, offset: 4 + 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] [L992] FCALL call write~int(0, { base: main_~head~0!base, offset: 8 + main_~head~0!offset }, 4); [L994] 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] [L997] 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] [L997-L1005] COND TRUE !(0 != main_#t~nondet1) [L997] 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] [L1008] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet5=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1008-L1035] COND FALSE !(0 != main_#t~nondet5) [L1008] havoc main_#t~nondet5; [L1018] 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] [L1019] FCALL call main_#t~mem7 := 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~mem7!base=0, main_#t~mem7!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1019-L1023] COND TRUE !(main_#t~mem7 != { base: 0, offset: 0 }) [L1019] havoc main_#t~mem7; 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] [L1026] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1026] main_~y~0 := main_#t~mem10; [L1026] havoc main_#t~mem10; [L1027] FCALL call main_#t~malloc11 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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] [L1027] FCALL call write~$Pointer$(main_#t~malloc11, { 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~malloc11!base=11, main_#t~malloc11!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] [L1028] FCALL call write~int(1, { base: main_~x~0!base, offset: 8 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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] 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~malloc11!base=11, main_#t~malloc11!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] [L1030] COND FALSE !(main_~y~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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] 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~malloc11!base=11, main_#t~malloc11!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] [L1041] FCALL call main_#t~mem13 := read~int({ base: main_~x~0!base, offset: 8 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!offset=0, main_#t~mem13=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] [L1041-L1044] COND TRUE !(1 != main_#t~mem13) [L1041] havoc main_#t~mem13; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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] [L1047] FCALL call main_#t~mem15 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1047] main_~x~0 := main_#t~mem15; [L1047] havoc main_#t~mem15; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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 }) [L1056] 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~malloc11!base=11, main_#t~malloc11!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] [L1057-L1062] COND FALSE !(!(main_~x~0 != { base: 0, offset: 0 })) [L1059] 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~malloc11!base=11, main_#t~malloc11!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] [L1060] FCALL call main_#t~mem18 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1060] main_~x~0 := main_#t~mem18; [L1060] havoc main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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] [L1061] 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~malloc11!base=11, main_#t~malloc11!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] [L1061] assert 0 == main_~head~0!base || 1 == #valid[main_~head~0!base]; [L1061] 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~malloc11!base=11, main_#t~malloc11!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] [L1057-L1062] COND TRUE !(main_~x~0 != { base: 0, offset: 0 }) [L1064] 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~malloc11!base=11, main_#t~malloc11!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] [L986-L1065] 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~malloc11!base=11, main_#t~malloc11!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~mem4, main_#t~nondet1, main_#t~nondet5, main_#t~malloc6, main_#t~nondet8, main_#t~mem9, main_#t~mem7, main_#t~mem10, main_#t~malloc11, main_#t~mem12, main_~y~0, main_#t~mem14, main_#t~mem13, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_~head~0, main_~x~0; [L989] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L989] 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] [L990] 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] [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~head~0!base, offset: 4 + 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] [L992] FCALL call write~int(0, { base: main_~head~0!base, offset: 8 + main_~head~0!offset }, 4); [L994] 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] [L997] 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] [L997-L1005] COND TRUE !(0 != main_#t~nondet1) [L997] 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] [L1008] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet5=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1008-L1035] COND FALSE !(0 != main_#t~nondet5) [L1008] havoc main_#t~nondet5; [L1018] 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] [L1019] FCALL call main_#t~mem7 := 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~mem7!base=0, main_#t~mem7!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1019-L1023] COND TRUE !(main_#t~mem7 != { base: 0, offset: 0 }) [L1019] havoc main_#t~mem7; 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] [L1026] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1026] main_~y~0 := main_#t~mem10; [L1026] havoc main_#t~mem10; [L1027] FCALL call main_#t~malloc11 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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] [L1027] FCALL call write~$Pointer$(main_#t~malloc11, { 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~malloc11!base=11, main_#t~malloc11!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] [L1028] FCALL call write~int(1, { base: main_~x~0!base, offset: 8 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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] 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~malloc11!base=11, main_#t~malloc11!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] [L1030] COND FALSE !(main_~y~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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] 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~malloc11!base=11, main_#t~malloc11!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] [L1041] FCALL call main_#t~mem13 := read~int({ base: main_~x~0!base, offset: 8 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!offset=0, main_#t~mem13=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] [L1041-L1044] COND TRUE !(1 != main_#t~mem13) [L1041] havoc main_#t~mem13; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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] [L1047] FCALL call main_#t~mem15 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1047] main_~x~0 := main_#t~mem15; [L1047] havoc main_#t~mem15; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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 }) [L1056] 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~malloc11!base=11, main_#t~malloc11!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] [L1057-L1062] COND FALSE !(!(main_~x~0 != { base: 0, offset: 0 })) [L1059] 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~malloc11!base=11, main_#t~malloc11!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] [L1060] FCALL call main_#t~mem18 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1060] main_~x~0 := main_#t~mem18; [L1060] havoc main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc11!base=11, main_#t~malloc11!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] [L1061] 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~malloc11!base=11, main_#t~malloc11!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] [L1061] assert 0 == main_~head~0!base || 1 == #valid[main_~head~0!base]; [L1061] 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~malloc11!base=11, main_#t~malloc11!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] [L1057-L1062] COND TRUE !(main_~x~0 != { base: 0, offset: 0 }) [L1064] 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~malloc11!base=11, main_#t~malloc11!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] [L986-L1065] 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~malloc11!base=11, main_#t~malloc11!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; [L989] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L989] ~head~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0] [L990] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L994] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L997-L1005] COND TRUE !(0 != #t~nondet1) [L997] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L1008-L1035] COND FALSE !(0 != #t~nondet5) [L1008] havoc #t~nondet5; [L1018] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1019] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1019-L1023] COND TRUE !(#t~mem7 != { base: 0, offset: 0 }) [L1019] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0] [L1026] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1026] ~y~0 := #t~mem10; [L1026] havoc #t~mem10; [L1027] FCALL call #t~malloc11 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0] [L1027] FCALL call write~$Pointer$(#t~malloc11, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1028] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1029] FCALL call write~$Pointer$(~y~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1030] COND FALSE !(~y~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0] [L1038] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1041] FCALL call #t~mem13 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1041-L1044] COND TRUE !(1 != #t~mem13) [L1041] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0] [L1047] FCALL call #t~mem15 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1047] ~x~0 := #t~mem15; [L1047] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0] [L1048-L1053] COND TRUE !(~x~0 != { base: 0, offset: 0 }) [L1056] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1057-L1062] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1059] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0] [L1060] FCALL call #t~mem18 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1060] ~x~0 := #t~mem18; [L1060] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1061] assert 0 == ~head~0!offset; VAL [#NULL!base=0, #NULL!offset=0] [L1061] assert 0 == ~head~0!base || 1 == #valid[~head~0!base]; [L1061] FCALL call ULTIMATE.dealloc(~head~0); VAL [#NULL!base=0, #NULL!offset=0] [L1057-L1062] COND TRUE !(~x~0 != { base: 0, offset: 0 }) [L1064] #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; [L989] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L989] ~head~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0] [L990] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L994] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L997-L1005] COND TRUE !(0 != #t~nondet1) [L997] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L1008-L1035] COND FALSE !(0 != #t~nondet5) [L1008] havoc #t~nondet5; [L1018] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1019] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1019-L1023] COND TRUE !(#t~mem7 != { base: 0, offset: 0 }) [L1019] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0] [L1026] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1026] ~y~0 := #t~mem10; [L1026] havoc #t~mem10; [L1027] FCALL call #t~malloc11 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0] [L1027] FCALL call write~$Pointer$(#t~malloc11, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1028] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1029] FCALL call write~$Pointer$(~y~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1030] COND FALSE !(~y~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0] [L1038] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1041] FCALL call #t~mem13 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1041-L1044] COND TRUE !(1 != #t~mem13) [L1041] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0] [L1047] FCALL call #t~mem15 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1047] ~x~0 := #t~mem15; [L1047] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0] [L1048-L1053] COND TRUE !(~x~0 != { base: 0, offset: 0 }) [L1056] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1057-L1062] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1059] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0] [L1060] FCALL call #t~mem18 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1060] ~x~0 := #t~mem18; [L1060] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1061] assert 0 == ~head~0!offset; VAL [#NULL!base=0, #NULL!offset=0] [L1061] assert 0 == ~head~0!base || 1 == #valid[~head~0!base]; [L1061] FCALL call ULTIMATE.dealloc(~head~0); VAL [#NULL!base=0, #NULL!offset=0] [L1057-L1062] COND TRUE !(~x~0 != { base: 0, offset: 0 }) [L1064] #res := 0; VAL [#NULL!base=0, #NULL!offset=0] [L989] SLL* head = malloc(sizeof(SLL)); [L990] head->next = ((void*)0) [L991] head->prev = ((void*)0) [L992] head->data = 0 [L994] SLL* x = head; [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x = head [L1019] EXPR x->next [L1019] COND FALSE !(x->next != ((void*)0)) [L1026] EXPR x->next [L1026] SLL* y = x->next; [L1027] x->next = malloc(sizeof(SLL)) [L1028] x->data = 1 [L1029] x->next = y [L1030] COND FALSE !(y != ((void*)0)) [L1038] x = head [L1041] EXPR x->data [L1041] COND FALSE !(x->data != 1) [L1047] EXPR x->next [L1047] x = x->next [L1048] COND FALSE !(\read(*x)) [L1056] x = head [L1057] COND TRUE x != ((void*)0) [L1059] head = x [L1060] EXPR x->next [L1060] x = x->next [L1061] free(head) [L1061] free(head) [L1057] COND FALSE !(x != ((void*)0)) [L1064] return 0; ----- [2018-11-23 05:18:50,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 05:18:50 ImpRootNode [2018-11-23 05:18:50,034 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 05:18:50,034 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:18:50,034 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:18:50,034 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:18:50,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:14:54" (3/4) ... [2018-11-23 05:18:50,038 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:18:50,038 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:18:50,039 INFO L168 Benchmark]: Toolchain (without parser) took 236347.34 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 956.6 MB in the beginning and 950.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-23 05:18:50,040 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:18:50,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:18:50,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:18:50,041 INFO L168 Benchmark]: Boogie Preprocessor took 24.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:18:50,041 INFO L168 Benchmark]: RCFGBuilder took 473.38 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.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:18:50,042 INFO L168 Benchmark]: CodeCheck took 235461.98 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 950.6 MB in the end (delta: 118.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-23 05:18:50,042 INFO L168 Benchmark]: Witness Printer took 4.03 ms. Allocated memory is still 2.7 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:18:50,044 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, 118 locations, 57 error locations. UNSAFE Result, 235.3s OverallTime, 123 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13312 SDtfs, 1216716164 SDslu, 160111616 SDs, 0 SdLazy, 1500583938 SolverSat, -1260635754 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 124.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19303 GetRequests, 17076 SyntacticMatches, 929 SemanticMatches, 1298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007025 ImplicationChecksByTransitivity, 230.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 34.5s InterpolantComputationTime, 2145 NumberOfCodeBlocks, 2145 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 1997 ConstructedInterpolants, 0 QuantifiedInterpolants, 305975 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 122 InterpolantComputations, 84 PerfectInterpolantSequences, 40/137 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: 986]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 986. Possible FailurePath: [L989] SLL* head = malloc(sizeof(SLL)); [L990] head->next = ((void*)0) [L991] head->prev = ((void*)0) [L992] head->data = 0 [L994] SLL* x = head; [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x = head [L1019] EXPR x->next [L1019] COND FALSE !(x->next != ((void*)0)) [L1026] EXPR x->next [L1026] SLL* y = x->next; [L1027] x->next = malloc(sizeof(SLL)) [L1028] x->data = 1 [L1029] x->next = y [L1030] COND FALSE !(y != ((void*)0)) [L1038] x = head [L1041] EXPR x->data [L1041] COND FALSE !(x->data != 1) [L1047] EXPR x->next [L1047] x = x->next [L1048] COND FALSE !(\read(*x)) [L1056] x = head [L1057] COND TRUE x != ((void*)0) [L1059] head = x [L1060] EXPR x->next [L1060] x = x->next [L1061] free(head) [L1061] free(head) [L1057] COND FALSE !(x != ((void*)0)) [L1064] return 0; * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 473.38 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.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. * CodeCheck took 235461.98 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 950.6 MB in the end (delta: 118.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 4.03 ms. Allocated memory is still 2.7 GB. Free memory is still 950.6 MB. There was no memory consumed. 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 05:18:51,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:18:51,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:18:51,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:18:51,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:18:51,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:18:51,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:18:51,583 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:18:51,584 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:18:51,585 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:18:51,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:18:51,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:18:51,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:18:51,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:18:51,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:18:51,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:18:51,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:18:51,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:18:51,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:18:51,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:18:51,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:18:51,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:18:51,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:18:51,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:18:51,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:18:51,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:18:51,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:18:51,602 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:18:51,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:18:51,603 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:18:51,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:18:51,604 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:18:51,604 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:18:51,604 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:18:51,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:18:51,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:18:51,607 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf [2018-11-23 05:18:51,618 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:18:51,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:18:51,619 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:18:51,620 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:18:51,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:18:51,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:18:51,620 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:18:51,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:18:51,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:18:51,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:18:51,621 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 05:18:51,621 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 05:18:51,621 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 05:18:51,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:18:51,622 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 05:18:51,622 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 05:18:51,622 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:18:51,622 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:18:51,622 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 05:18:51,622 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 05:18:51,623 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:18:51,623 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:18:51,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 05:18:51,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:18:51,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:18:51,623 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 05:18:51,623 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 05:18:51,623 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:18:51,623 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 05:18:51,624 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_bc0874c3-74cd-4a2d-89a6-748a356923f3/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 -> a0270bdb02afc11bd88836e5502a475e981de345 [2018-11-23 05:18:51,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:18:51,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:18:51,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:18:51,663 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:18:51,663 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:18:51,664 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/../../sv-benchmarks/c/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 05:18:51,699 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/data/46bd0769c/fdce08312a634beca1d59fff65b993a3/FLAG42dd2d37a [2018-11-23 05:18:52,145 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:18:52,146 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/sv-benchmarks/c/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 05:18:52,155 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/data/46bd0769c/fdce08312a634beca1d59fff65b993a3/FLAG42dd2d37a [2018-11-23 05:18:52,164 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/bin-2019/ukojak/data/46bd0769c/fdce08312a634beca1d59fff65b993a3 [2018-11-23 05:18:52,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:18:52,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:18:52,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:18:52,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:18:52,170 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:18:52,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:18:52" (1/1) ... [2018-11-23 05:18:52,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@705312dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52, skipping insertion in model container [2018-11-23 05:18:52,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:18:52" (1/1) ... [2018-11-23 05:18:52,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:18:52,207 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:18:52,414 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:18:52,423 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:18:52,458 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:18:52,527 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:18:52,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52 WrapperNode [2018-11-23 05:18:52,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:18:52,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:18:52,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:18:52,528 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:18:52,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52" (1/1) ... [2018-11-23 05:18:52,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52" (1/1) ... [2018-11-23 05:18:52,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:18:52,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:18:52,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:18:52,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:18:52,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52" (1/1) ... [2018-11-23 05:18:52,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52" (1/1) ... [2018-11-23 05:18:52,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52" (1/1) ... [2018-11-23 05:18:52,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52" (1/1) ... [2018-11-23 05:18:52,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52" (1/1) ... [2018-11-23 05:18:52,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52" (1/1) ... [2018-11-23 05:18:52,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52" (1/1) ... [2018-11-23 05:18:52,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:18:52,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:18:52,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:18:52,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:18:52,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:18:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc0874c3-74cd-4a2d-89a6-748a356923f3/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 05:18:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:18:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 05:18:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 05:18:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 05:18:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:18:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 05:18:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:18:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:18:53,332 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:18:53,332 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 05:18:53,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:18:53 BoogieIcfgContainer [2018-11-23 05:18:53,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:18:53,333 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 05:18:53,333 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 05:18:53,341 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 05:18:53,341 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:18:53" (1/1) ... [2018-11-23 05:18:53,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:18:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:18:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 101 states and 113 transitions. [2018-11-23 05:18:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-11-23 05:18:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-11-23 05:18:53,381 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:18:53,413 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 05:18:53,417 INFO L168 Benchmark]: Toolchain (without parser) took 1250.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:18:53,418 INFO L168 Benchmark]: CDTParser took 0.10 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 05:18:53,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 944.4 MB in the beginning and 1.2 GB in the end (delta: -206.3 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:18:53,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.49 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:18:53,420 INFO L168 Benchmark]: Boogie Preprocessor took 27.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:18:53,420 INFO L168 Benchmark]: RCFGBuilder took 741.58 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:18:53,421 INFO L168 Benchmark]: CodeCheck took 83.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:18:53,424 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.10 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 359.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 944.4 MB in the beginning and 1.2 GB in the end (delta: -206.3 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.49 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 741.58 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * CodeCheck took 83.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...