./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:30:44,111 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:30:44,112 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:30:44,119 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:30:44,119 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:30:44,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:30:44,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:30:44,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:30:44,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:30:44,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:30:44,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:30:44,124 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:30:44,125 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:30:44,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:30:44,126 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:30:44,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:30:44,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:30:44,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:30:44,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:30:44,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:30:44,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:30:44,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:30:44,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:30:44,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:30:44,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:30:44,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:30:44,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:30:44,136 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:30:44,137 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:30:44,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:30:44,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:30:44,138 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:30:44,138 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:30:44,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:30:44,139 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:30:44,140 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:30:44,140 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:30:44,149 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:30:44,150 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:30:44,150 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:30:44,150 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:30:44,151 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:30:44,151 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:30:44,151 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:30:44,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:30:44,151 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:30:44,152 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:30:44,152 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:30:44,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:30:44,152 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:30:44,152 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:30:44,152 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:30:44,152 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:30:44,153 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:30:44,153 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:30:44,153 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:30:44,153 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:30:44,153 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:30:44,153 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:30:44,153 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:30:44,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:30:44,154 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:30:44,154 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:30:44,154 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:30:44,154 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:30:44,154 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:30:44,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:30:44,154 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-11-23 02:30:44,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:30:44,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:30:44,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:30:44,187 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:30:44,187 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:30:44,187 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-23 02:30:44,229 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/data/f9d6c3e23/052170c7bc4d4d63951c80ff39a165b6/FLAG8bd64e186 [2018-11-23 02:30:44,674 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:30:44,674 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-23 02:30:44,683 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/data/f9d6c3e23/052170c7bc4d4d63951c80ff39a165b6/FLAG8bd64e186 [2018-11-23 02:30:44,693 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/data/f9d6c3e23/052170c7bc4d4d63951c80ff39a165b6 [2018-11-23 02:30:44,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:30:44,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:30:44,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:30:44,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:30:44,698 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:30:44,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:30:44" (1/1) ... [2018-11-23 02:30:44,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136a9c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:44, skipping insertion in model container [2018-11-23 02:30:44,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:30:44" (1/1) ... [2018-11-23 02:30:44,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:30:44,735 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:30:44,927 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:30:44,933 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:30:45,008 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:30:45,035 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:30:45,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45 WrapperNode [2018-11-23 02:30:45,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:30:45,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:30:45,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:30:45,036 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:30:45,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45" (1/1) ... [2018-11-23 02:30:45,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45" (1/1) ... [2018-11-23 02:30:45,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:30:45,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:30:45,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:30:45,056 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:30:45,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45" (1/1) ... [2018-11-23 02:30:45,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45" (1/1) ... [2018-11-23 02:30:45,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45" (1/1) ... [2018-11-23 02:30:45,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45" (1/1) ... [2018-11-23 02:30:45,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45" (1/1) ... [2018-11-23 02:30:45,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45" (1/1) ... [2018-11-23 02:30:45,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45" (1/1) ... [2018-11-23 02:30:45,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:30:45,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:30:45,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:30:45,087 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:30:45,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:30:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:30:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:30:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:30:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:30:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:30:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 02:30:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 02:30:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:30:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:30:45,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:30:45,435 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:30:45,435 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-11-23 02:30:45,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:30:45 BoogieIcfgContainer [2018-11-23 02:30:45,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:30:45,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:30:45,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:30:45,438 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:30:45,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:30:44" (1/3) ... [2018-11-23 02:30:45,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a71dd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:30:45, skipping insertion in model container [2018-11-23 02:30:45,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:45" (2/3) ... [2018-11-23 02:30:45,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a71dd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:30:45, skipping insertion in model container [2018-11-23 02:30:45,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:30:45" (3/3) ... [2018-11-23 02:30:45,440 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-11-23 02:30:45,446 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:30:45,451 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-23 02:30:45,460 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-23 02:30:45,482 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:30:45,483 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:30:45,483 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:30:45,483 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:30:45,483 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:30:45,483 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:30:45,483 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:30:45,484 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:30:45,484 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:30:45,497 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-11-23 02:30:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 02:30:45,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:45,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:45,503 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:45,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash 11196085, now seen corresponding path program 1 times [2018-11-23 02:30:45,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:45,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:45,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:45,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:45,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:45,602 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 02:30:45,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:45,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:30:45,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:30:45,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:30:45,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:45,615 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2018-11-23 02:30:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:45,658 INFO L93 Difference]: Finished difference Result 188 states and 306 transitions. [2018-11-23 02:30:45,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:30:45,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 02:30:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:45,665 INFO L225 Difference]: With dead ends: 188 [2018-11-23 02:30:45,665 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 02:30:45,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:45,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 02:30:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-11-23 02:30:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 02:30:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-11-23 02:30:45,694 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 8 [2018-11-23 02:30:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:45,695 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-11-23 02:30:45,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:30:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-23 02:30:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 02:30:45,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:45,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:45,696 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:45,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1909121887, now seen corresponding path program 1 times [2018-11-23 02:30:45,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:45,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:45,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:45,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:45,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:45,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 02:30:45,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:45,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:30:45,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:30:45,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:30:45,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:45,739 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 3 states. [2018-11-23 02:30:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:45,754 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-23 02:30:45,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:30:45,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 02:30:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:45,755 INFO L225 Difference]: With dead ends: 85 [2018-11-23 02:30:45,756 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 02:30:45,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 02:30:45,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-23 02:30:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 02:30:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-11-23 02:30:45,761 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-11-23 02:30:45,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:45,761 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-11-23 02:30:45,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:30:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-11-23 02:30:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 02:30:45,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:45,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:45,762 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:45,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:45,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1909123809, now seen corresponding path program 1 times [2018-11-23 02:30:45,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:45,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:45,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:45,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:45,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:45,807 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 02:30:45,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:45,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:30:45,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:30:45,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:30:45,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:30:45,808 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 4 states. [2018-11-23 02:30:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:45,857 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-11-23 02:30:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:30:45,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 02:30:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:45,858 INFO L225 Difference]: With dead ends: 84 [2018-11-23 02:30:45,858 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 02:30:45,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:30:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 02:30:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-11-23 02:30:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 02:30:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-23 02:30:45,862 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 14 [2018-11-23 02:30:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:45,863 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-23 02:30:45,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:30:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-23 02:30:45,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 02:30:45,863 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:45,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:45,864 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:45,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:45,864 INFO L82 PathProgramCache]: Analyzing trace with hash -44725957, now seen corresponding path program 1 times [2018-11-23 02:30:45,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:45,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:45,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:45,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:45,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:45,905 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 02:30:45,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:45,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:30:45,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:30:45,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:30:45,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:45,907 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2018-11-23 02:30:45,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:45,974 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-11-23 02:30:45,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:30:45,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 02:30:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:45,975 INFO L225 Difference]: With dead ends: 83 [2018-11-23 02:30:45,975 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 02:30:45,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 02:30:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-11-23 02:30:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 02:30:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-11-23 02:30:45,979 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 19 [2018-11-23 02:30:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:45,979 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-11-23 02:30:45,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:30:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-11-23 02:30:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:30:45,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:45,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:45,980 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:45,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:45,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1386500464, now seen corresponding path program 1 times [2018-11-23 02:30:45,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:45,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:45,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:46,007 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 02:30:46,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:46,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:30:46,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:30:46,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:30:46,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:30:46,008 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 4 states. [2018-11-23 02:30:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:46,067 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2018-11-23 02:30:46,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:30:46,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 02:30:46,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:46,068 INFO L225 Difference]: With dead ends: 136 [2018-11-23 02:30:46,069 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 02:30:46,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:30:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 02:30:46,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2018-11-23 02:30:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 02:30:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-11-23 02:30:46,074 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2018-11-23 02:30:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:46,074 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-23 02:30:46,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:30:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-23 02:30:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:30:46,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:46,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:46,076 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:46,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:46,076 INFO L82 PathProgramCache]: Analyzing trace with hash 725856891, now seen corresponding path program 1 times [2018-11-23 02:30:46,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:46,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:46,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:46,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:46,098 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 02:30:46,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:46,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:30:46,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:30:46,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:30:46,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:46,099 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2018-11-23 02:30:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:46,110 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2018-11-23 02:30:46,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:30:46,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 02:30:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:46,111 INFO L225 Difference]: With dead ends: 141 [2018-11-23 02:30:46,111 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 02:30:46,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 02:30:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2018-11-23 02:30:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 02:30:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-11-23 02:30:46,116 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 24 [2018-11-23 02:30:46,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:46,117 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-11-23 02:30:46,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:30:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-11-23 02:30:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:30:46,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:46,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:46,118 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:46,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1026716690, now seen corresponding path program 1 times [2018-11-23 02:30:46,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:46,155 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 02:30:46,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:46,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:30:46,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:30:46,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:30:46,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:46,156 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 3 states. [2018-11-23 02:30:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:46,169 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-23 02:30:46,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:30:46,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 02:30:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:46,170 INFO L225 Difference]: With dead ends: 78 [2018-11-23 02:30:46,170 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 02:30:46,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 02:30:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 02:30:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 02:30:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-11-23 02:30:46,176 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 25 [2018-11-23 02:30:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:46,176 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-11-23 02:30:46,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:30:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-23 02:30:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:30:46,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:46,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:46,177 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:46,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:46,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1611661129, now seen corresponding path program 1 times [2018-11-23 02:30:46,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:46,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:46,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:46,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:46,217 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 02:30:46,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:46,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:30:46,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:30:46,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:30:46,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:46,218 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2018-11-23 02:30:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:46,225 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-11-23 02:30:46,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:30:46,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 02:30:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:46,226 INFO L225 Difference]: With dead ends: 79 [2018-11-23 02:30:46,226 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 02:30:46,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 02:30:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-23 02:30:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 02:30:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2018-11-23 02:30:46,231 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 27 [2018-11-23 02:30:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:46,231 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-11-23 02:30:46,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:30:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2018-11-23 02:30:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:30:46,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:46,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:46,233 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:46,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1611663051, now seen corresponding path program 1 times [2018-11-23 02:30:46,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:46,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:46,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:46,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:46,288 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 02:30:46,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:46,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:30:46,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:30:46,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:30:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:30:46,289 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 4 states. [2018-11-23 02:30:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:46,343 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-23 02:30:46,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:30:46,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 02:30:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:46,345 INFO L225 Difference]: With dead ends: 78 [2018-11-23 02:30:46,345 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 02:30:46,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:30:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 02:30:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-23 02:30:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 02:30:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2018-11-23 02:30:46,350 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 27 [2018-11-23 02:30:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:46,350 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2018-11-23 02:30:46,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:30:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-23 02:30:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:30:46,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:46,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:46,352 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:46,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:46,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1836072976, now seen corresponding path program 1 times [2018-11-23 02:30:46,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:46,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:46,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:46,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:46,406 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 02:30:46,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:46,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:30:46,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:30:46,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:30:46,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:30:46,407 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2018-11-23 02:30:46,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:46,458 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-11-23 02:30:46,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:30:46,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 02:30:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:46,459 INFO L225 Difference]: With dead ends: 190 [2018-11-23 02:30:46,459 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 02:30:46,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:30:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 02:30:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2018-11-23 02:30:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 02:30:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-11-23 02:30:46,465 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 28 [2018-11-23 02:30:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:46,465 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-11-23 02:30:46,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:30:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-23 02:30:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:30:46,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:46,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:46,467 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:46,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash 870546418, now seen corresponding path program 1 times [2018-11-23 02:30:46,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:46,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:46,537 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 02:30:46,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:46,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:30:46,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:30:46,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:30:46,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:30:46,538 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2018-11-23 02:30:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:46,661 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2018-11-23 02:30:46,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:30:46,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 02:30:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:46,663 INFO L225 Difference]: With dead ends: 182 [2018-11-23 02:30:46,663 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 02:30:46,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:30:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 02:30:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2018-11-23 02:30:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 02:30:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-11-23 02:30:46,668 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 28 [2018-11-23 02:30:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:46,668 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-11-23 02:30:46,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:30:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-11-23 02:30:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:30:46,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:46,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:46,669 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:46,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash 769950578, now seen corresponding path program 1 times [2018-11-23 02:30:46,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:46,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:46,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:46,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:46,833 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 02:30:46,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:46,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:30:46,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:30:46,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:30:46,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:30:46,834 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-11-23 02:30:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:47,116 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2018-11-23 02:30:47,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:30:47,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-11-23 02:30:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:47,119 INFO L225 Difference]: With dead ends: 241 [2018-11-23 02:30:47,119 INFO L226 Difference]: Without dead ends: 239 [2018-11-23 02:30:47,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:30:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-23 02:30:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 98. [2018-11-23 02:30:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 02:30:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-11-23 02:30:47,125 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 28 [2018-11-23 02:30:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:47,129 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-11-23 02:30:47,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:30:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-11-23 02:30:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 02:30:47,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:47,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:47,130 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:47,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1506132002, now seen corresponding path program 1 times [2018-11-23 02:30:47,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:47,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:47,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:47,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:47,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:47,225 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 02:30:47,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:47,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:30:47,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:30:47,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:30:47,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:30:47,227 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2018-11-23 02:30:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:47,307 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2018-11-23 02:30:47,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:30:47,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 02:30:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:47,308 INFO L225 Difference]: With dead ends: 145 [2018-11-23 02:30:47,308 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 02:30:47,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:30:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 02:30:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-11-23 02:30:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 02:30:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2018-11-23 02:30:47,313 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 30 [2018-11-23 02:30:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:47,313 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2018-11-23 02:30:47,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:30:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2018-11-23 02:30:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 02:30:47,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:47,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:47,315 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:47,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash -677189726, now seen corresponding path program 1 times [2018-11-23 02:30:47,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:47,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:47,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:47,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:47,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:47,334 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 02:30:47,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:47,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:30:47,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:30:47,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:30:47,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:47,335 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 3 states. [2018-11-23 02:30:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:47,360 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2018-11-23 02:30:47,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:30:47,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 02:30:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:47,362 INFO L225 Difference]: With dead ends: 119 [2018-11-23 02:30:47,363 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 02:30:47,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 02:30:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-23 02:30:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 02:30:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2018-11-23 02:30:47,368 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 30 [2018-11-23 02:30:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:47,368 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2018-11-23 02:30:47,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:30:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2018-11-23 02:30:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 02:30:47,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:47,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:47,369 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:47,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1818543518, now seen corresponding path program 1 times [2018-11-23 02:30:47,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:47,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:47,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:47,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:47,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:30:47,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:47,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:30:47,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:30:47,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:30:47,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:30:47,509 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand 7 states. [2018-11-23 02:30:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:47,752 INFO L93 Difference]: Finished difference Result 277 states and 322 transitions. [2018-11-23 02:30:47,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:30:47,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-23 02:30:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:47,753 INFO L225 Difference]: With dead ends: 277 [2018-11-23 02:30:47,753 INFO L226 Difference]: Without dead ends: 275 [2018-11-23 02:30:47,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:30:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-23 02:30:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 120. [2018-11-23 02:30:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 02:30:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2018-11-23 02:30:47,761 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 31 [2018-11-23 02:30:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:47,761 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2018-11-23 02:30:47,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:30:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2018-11-23 02:30:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 02:30:47,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:47,762 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:47,762 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:47,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash -828341282, now seen corresponding path program 1 times [2018-11-23 02:30:47,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:47,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:47,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:47,835 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 02:30:47,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:30:47,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:30:47,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:47,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:30:47,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:30:47,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 02:30:47,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:47,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:47,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:30:47,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 02:30:47,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:47,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:47,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:47,969 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 02:30:47,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 02:30:47,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:47,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 02:30:47,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:47,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:47,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 02:30:48,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:48,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 02:30:48,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-11-23 02:30:48,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 02:30:48,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-23 02:30:48,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 02:30:48,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-23 02:30:48,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,051 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-23 02:30:48,057 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 02:30:48,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:30:48,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-23 02:30:48,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:30:48,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:30:48,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:30:48,073 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 8 states. [2018-11-23 02:30:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:48,239 INFO L93 Difference]: Finished difference Result 224 states and 260 transitions. [2018-11-23 02:30:48,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:30:48,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 02:30:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:48,241 INFO L225 Difference]: With dead ends: 224 [2018-11-23 02:30:48,241 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 02:30:48,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:30:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 02:30:48,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2018-11-23 02:30:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 02:30:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-11-23 02:30:48,255 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 33 [2018-11-23 02:30:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:48,255 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-11-23 02:30:48,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:30:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-11-23 02:30:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 02:30:48,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:48,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:48,256 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:48,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:48,257 INFO L82 PathProgramCache]: Analyzing trace with hash -693545280, now seen corresponding path program 1 times [2018-11-23 02:30:48,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:48,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:48,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:48,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:48,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:48,369 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 02:30:48,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:48,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:30:48,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:30:48,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:30:48,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:30:48,369 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 6 states. [2018-11-23 02:30:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:48,483 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2018-11-23 02:30:48,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:30:48,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 02:30:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:48,483 INFO L225 Difference]: With dead ends: 165 [2018-11-23 02:30:48,483 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 02:30:48,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:30:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 02:30:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 121. [2018-11-23 02:30:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 02:30:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2018-11-23 02:30:48,492 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 33 [2018-11-23 02:30:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:48,493 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2018-11-23 02:30:48,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:30:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2018-11-23 02:30:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 02:30:48,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:48,493 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:48,494 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:48,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:48,494 INFO L82 PathProgramCache]: Analyzing trace with hash 928343854, now seen corresponding path program 1 times [2018-11-23 02:30:48,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:48,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:48,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:48,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:48,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:30:48,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:30:48,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:30:48,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:48,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:30:48,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 02:30:48,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 02:30:48,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-23 02:30:48,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 02:30:48,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 02:30:48,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 02:30:48,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:48,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 02:30:48,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:48,718 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-11-23 02:30:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:30:48,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:30:48,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-11-23 02:30:48,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 02:30:48,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:30:48,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:30:48,737 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 10 states. [2018-11-23 02:30:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:48,944 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2018-11-23 02:30:48,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:30:48,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-11-23 02:30:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:48,945 INFO L225 Difference]: With dead ends: 225 [2018-11-23 02:30:48,945 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 02:30:48,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:30:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 02:30:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 138. [2018-11-23 02:30:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 02:30:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2018-11-23 02:30:48,959 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 36 [2018-11-23 02:30:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:48,959 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2018-11-23 02:30:48,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 02:30:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2018-11-23 02:30:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 02:30:48,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:48,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:48,961 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:48,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:48,961 INFO L82 PathProgramCache]: Analyzing trace with hash 36989377, now seen corresponding path program 1 times [2018-11-23 02:30:48,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:48,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:48,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:48,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:48,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:48,990 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 02:30:48,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:48,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:30:48,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:30:48,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:30:48,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:48,991 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand 3 states. [2018-11-23 02:30:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:49,023 INFO L93 Difference]: Finished difference Result 297 states and 364 transitions. [2018-11-23 02:30:49,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:30:49,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 02:30:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:49,025 INFO L225 Difference]: With dead ends: 297 [2018-11-23 02:30:49,025 INFO L226 Difference]: Without dead ends: 215 [2018-11-23 02:30:49,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:30:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-23 02:30:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 175. [2018-11-23 02:30:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-23 02:30:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2018-11-23 02:30:49,034 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 36 [2018-11-23 02:30:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:49,034 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2018-11-23 02:30:49,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:30:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2018-11-23 02:30:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 02:30:49,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:49,035 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:49,035 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:49,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1278661403, now seen corresponding path program 1 times [2018-11-23 02:30:49,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:49,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:49,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:30:49,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:49,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:30:49,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:30:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:30:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:30:49,075 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand 4 states. [2018-11-23 02:30:49,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:49,158 INFO L93 Difference]: Finished difference Result 291 states and 353 transitions. [2018-11-23 02:30:49,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:30:49,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-23 02:30:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:49,160 INFO L225 Difference]: With dead ends: 291 [2018-11-23 02:30:49,160 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 02:30:49,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:30:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 02:30:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177. [2018-11-23 02:30:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-23 02:30:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 213 transitions. [2018-11-23 02:30:49,172 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 213 transitions. Word has length 40 [2018-11-23 02:30:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:49,173 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 213 transitions. [2018-11-23 02:30:49,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:30:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 213 transitions. [2018-11-23 02:30:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 02:30:49,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:49,173 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:49,174 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:49,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash 257593049, now seen corresponding path program 1 times [2018-11-23 02:30:49,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:49,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:49,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:49,396 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 02:30:49,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:30:49,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:30:49,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:49,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:30:49,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 02:30:49,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 02:30:49,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 02:30:49,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 02:30:49,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 02:30:49,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 02:30:49,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-23 02:30:49,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:49,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:49,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 02:30:49,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-23 02:30:49,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:49,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 02:30:49,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-23 02:30:49,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 02:30:49,543 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,548 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-23 02:30:49,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:49,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 02:30:49,568 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-11-23 02:30:49,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:30:49,580 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,585 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,599 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:51 [2018-11-23 02:30:49,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-11-23 02:30:49,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:49,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-23 02:30:49,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-11-23 02:30:49,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:49,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-23 02:30:49,654 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:30:49,669 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2018-11-23 02:30:49,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2018-11-23 02:30:49,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:49,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 02:30:49,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-23 02:30:49,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:30:49,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:30:49,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-23 02:30:49,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:49,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 02:30:49,790 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 02:30:49,800 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:49,806 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2018-11-23 02:30:49,821 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 02:30:49,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:30:49,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-23 02:30:49,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 02:30:49,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 02:30:49,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=211, Unknown=1, NotChecked=0, Total=272 [2018-11-23 02:30:49,840 INFO L87 Difference]: Start difference. First operand 177 states and 213 transitions. Second operand 17 states. [2018-11-23 02:30:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:51,212 INFO L93 Difference]: Finished difference Result 479 states and 565 transitions. [2018-11-23 02:30:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 02:30:51,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-23 02:30:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:51,214 INFO L225 Difference]: With dead ends: 479 [2018-11-23 02:30:51,214 INFO L226 Difference]: Without dead ends: 387 [2018-11-23 02:30:51,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=736, Unknown=2, NotChecked=0, Total=992 [2018-11-23 02:30:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-23 02:30:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 213. [2018-11-23 02:30:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-23 02:30:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 254 transitions. [2018-11-23 02:30:51,224 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 254 transitions. Word has length 40 [2018-11-23 02:30:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:51,225 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 254 transitions. [2018-11-23 02:30:51,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 02:30:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2018-11-23 02:30:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 02:30:51,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:51,225 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:51,226 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:51,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:51,226 INFO L82 PathProgramCache]: Analyzing trace with hash -427010471, now seen corresponding path program 1 times [2018-11-23 02:30:51,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:51,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:51,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:51,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:51,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:51,548 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 02:30:51,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:30:51,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:30:51,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:51,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:30:51,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 02:30:51,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 02:30:51,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:51,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:51,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 02:30:51,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 233 [2018-11-23 02:30:51,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 02:30:51,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 196 [2018-11-23 02:30:51,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 02:30:51,809 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 184 [2018-11-23 02:30:51,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:51,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 91 [2018-11-23 02:30:51,845 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,860 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,872 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 89 [2018-11-23 02:30:51,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 02:30:51,946 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2018-11-23 02:30:51,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 02:30:51,958 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-11-23 02:30:51,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 02:30:51,972 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,977 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,981 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,985 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:51,998 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2018-11-23 02:30:52,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 02:30:52,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 88 [2018-11-23 02:30:52,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 100 [2018-11-23 02:30:52,098 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 97 [2018-11-23 02:30:52,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 02:30:52,128 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,142 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2018-11-23 02:30:52,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 02:30:52,180 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 79 [2018-11-23 02:30:52,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:30:52,202 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,211 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,217 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,233 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:153, output treesize:114 [2018-11-23 02:30:52,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 149 [2018-11-23 02:30:52,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-23 02:30:52,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 92 [2018-11-23 02:30:52,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-11-23 02:30:52,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,348 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:154, output treesize:130 [2018-11-23 02:30:52,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:30:52,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 121 [2018-11-23 02:30:52,454 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-11-23 02:30:52,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2018-11-23 02:30:52,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:30:52,487 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:30:52,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-23 02:30:52,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:30:52,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-11-23 02:30:52,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-11-23 02:30:52,517 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-23 02:30:52,524 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,525 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:30:52,530 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:149, output treesize:7 [2018-11-23 02:30:52,539 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 02:30:52,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:30:52,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-23 02:30:52,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 02:30:52,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 02:30:52,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=223, Unknown=1, NotChecked=0, Total=272 [2018-11-23 02:30:52,554 INFO L87 Difference]: Start difference. First operand 213 states and 254 transitions. Second operand 17 states. [2018-11-23 02:30:53,471 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 99 [2018-11-23 02:30:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:55,174 INFO L93 Difference]: Finished difference Result 778 states and 904 transitions. [2018-11-23 02:30:55,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 02:30:55,175 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-23 02:30:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:55,177 INFO L225 Difference]: With dead ends: 778 [2018-11-23 02:30:55,178 INFO L226 Difference]: Without dead ends: 776 [2018-11-23 02:30:55,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=555, Invalid=1700, Unknown=1, NotChecked=0, Total=2256 [2018-11-23 02:30:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-11-23 02:30:55,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 249. [2018-11-23 02:30:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-23 02:30:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 296 transitions. [2018-11-23 02:30:55,201 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 296 transitions. Word has length 40 [2018-11-23 02:30:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:55,201 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 296 transitions. [2018-11-23 02:30:55,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 02:30:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 296 transitions. [2018-11-23 02:30:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 02:30:55,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:55,202 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:55,203 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:55,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:55,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1953426060, now seen corresponding path program 1 times [2018-11-23 02:30:55,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:30:55,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:30:55,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:55,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:55,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:30:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:30:55,250 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=14, |#NULL.offset|=9, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] RET #337#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret28 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=15, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume #t~short7; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=15, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~nondet8|=0] [?] assume !(0 != #t~nondet8);havoc #t~nondet8; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume 0 == ~len~0;~len~0 := 1; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem19.base|=0, |main_#t~mem19.offset|=0] [?] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset);havoc #t~mem19.base, #t~mem19.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem20.base|=0, |main_#t~mem20.offset|=0] [?] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset;havoc #t~mem21.base, #t~mem21.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=0, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume 1 == ~len~0;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem22.base, #t~mem22.offset;havoc #t~mem22.base, #t~mem22.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !(0 == ~len~0);~len~0 := 2; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem19.base|=13, |main_#t~mem19.offset|=10] [?] assume !(0 == #t~mem19.base && 0 == #t~mem19.offset);havoc #t~mem19.base, #t~mem19.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=14, #NULL.offset=9, old(#NULL.base)=14, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L991] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L991] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L992] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); [L993] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L993] havoc #t~mem3.base, #t~mem3.offset; [L993] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); [L993] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem5.base=15, #t~mem5.offset=0, #t~short7=true, ~list~0.base=12, ~list~0.offset=0] [L993] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem5.base=15, #t~mem5.offset=0, #t~short7=true, ~list~0.base=12, ~list~0.offset=0] [L993] assume !!#t~short7; [L993] havoc #t~mem6.base, #t~mem6.offset; [L993] havoc #t~short7; [L993] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~list~0.base=12, ~list~0.offset=0] [L995] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L998-L1006] assume !(0 != #t~nondet8); [L998] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1008] ~end~0.base, ~end~0.offset := 0, 0; [L1009] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1012] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1014-L1034] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1016] ~len~0 := 0; [L1017] call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); [L1017] ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; [L1017] havoc #t~mem18.base, #t~mem18.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=0, ~list~0.base=12, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=0, ~list~0.base=12, ~list~0.offset=0] [L1020-L1023] assume 0 == ~len~0; [L1021] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem19.base=0, #t~mem19.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1025] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1026] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1026] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1026] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1027] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [L1027] ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; [L1027] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1028-L1029] assume 1 == ~len~0; [L1029] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [L1029] ~inner~0.base, ~inner~0.offset := #t~mem22.base, #t~mem22.offset; [L1029] havoc #t~mem22.base, #t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1020-L1023] assume !(0 == ~len~0); [L1023] ~len~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem19.base=13, #t~mem19.offset=10, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=14, #NULL.offset=9, old(#NULL.base)=14, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L991] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L991] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L992] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); [L993] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L993] havoc #t~mem3.base, #t~mem3.offset; [L993] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); [L993] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem5.base=15, #t~mem5.offset=0, #t~short7=true, ~list~0.base=12, ~list~0.offset=0] [L993] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem5.base=15, #t~mem5.offset=0, #t~short7=true, ~list~0.base=12, ~list~0.offset=0] [L993] assume !!#t~short7; [L993] havoc #t~mem6.base, #t~mem6.offset; [L993] havoc #t~short7; [L993] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~list~0.base=12, ~list~0.offset=0] [L995] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L998-L1006] assume !(0 != #t~nondet8); [L998] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1008] ~end~0.base, ~end~0.offset := 0, 0; [L1009] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1012] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1014-L1034] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1016] ~len~0 := 0; [L1017] call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); [L1017] ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; [L1017] havoc #t~mem18.base, #t~mem18.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=0, ~list~0.base=12, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=0, ~list~0.base=12, ~list~0.offset=0] [L1020-L1023] assume 0 == ~len~0; [L1021] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem19.base=0, #t~mem19.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1025] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1026] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1026] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1026] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1027] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [L1027] ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; [L1027] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1028-L1029] assume 1 == ~len~0; [L1029] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [L1029] ~inner~0.base, ~inner~0.offset := #t~mem22.base, #t~mem22.offset; [L1029] havoc #t~mem22.base, #t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1020-L1023] assume !(0 == ~len~0); [L1023] ~len~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem19.base=13, #t~mem19.offset=10, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; [L992] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L993] havoc #t~mem3; [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem6; [L993] havoc #t~short7; [L993] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1029] ~inner~0 := #t~mem22; [L1029] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1020] COND FALSE !(0 == ~len~0) [L1023] ~len~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=13, #t~mem19!offset=10, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] COND TRUE !({ base: 0, offset: 0 } == #t~mem19) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; [L992] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L993] havoc #t~mem3; [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem6; [L993] havoc #t~short7; [L993] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1029] ~inner~0 := #t~mem22; [L1029] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1020] COND FALSE !(0 == ~len~0) [L1023] ~len~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=13, #t~mem19!offset=10, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] COND TRUE !({ base: 0, offset: 0 } == #t~mem19) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; [L992] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L993] havoc #t~mem3; [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem6; [L993] havoc #t~short7; [L993] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1029] ~inner~0 := #t~mem22; [L1029] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1020] COND FALSE !(0 == ~len~0) [L1023] ~len~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=13, #t~mem19!offset=10, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] COND TRUE !({ base: 0, offset: 0 } == #t~mem19) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; [L992] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L993] havoc #t~mem3; [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem6; [L993] havoc #t~short7; [L993] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1029] ~inner~0 := #t~mem22; [L1029] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1020] COND FALSE !(0 == ~len~0) [L1023] ~len~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=13, #t~mem19!offset=10, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] COND TRUE !({ base: 0, offset: 0 } == #t~mem19) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={12:0}, list->inner={15:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={15:0}, len=0, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={15:0}, inner->inner={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={12:0}, inner={15:0}, inner->next={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={11:1}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={11:1}, inner->inner={13:10}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] ----- [2018-11-23 02:30:55,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:30:55 BoogieIcfgContainer [2018-11-23 02:30:55,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:30:55,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:30:55,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:30:55,334 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:30:55,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:30:45" (3/4) ... [2018-11-23 02:30:55,336 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=14, |#NULL.offset|=9, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] RET #337#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret28 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=15, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume #t~short7; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=15, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~nondet8|=0] [?] assume !(0 != #t~nondet8);havoc #t~nondet8; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume 0 == ~len~0;~len~0 := 1; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem19.base|=0, |main_#t~mem19.offset|=0] [?] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset);havoc #t~mem19.base, #t~mem19.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem20.base|=0, |main_#t~mem20.offset|=0] [?] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=15, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset;havoc #t~mem21.base, #t~mem21.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=0, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume 1 == ~len~0;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem22.base, #t~mem22.offset;havoc #t~mem22.base, #t~mem22.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=1, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !(0 == ~len~0);~len~0 := 2; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem19.base|=13, |main_#t~mem19.offset|=10] [?] assume !(0 == #t~mem19.base && 0 == #t~mem19.offset);havoc #t~mem19.base, #t~mem19.offset; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~end~0.base=12, main_~end~0.offset=0, main_~inner~0.base=11, main_~inner~0.offset=1, main_~len~0=2, main_~list~0.base=12, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=14, #NULL.offset=9, old(#NULL.base)=14, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L991] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L991] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L992] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); [L993] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L993] havoc #t~mem3.base, #t~mem3.offset; [L993] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); [L993] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem5.base=15, #t~mem5.offset=0, #t~short7=true, ~list~0.base=12, ~list~0.offset=0] [L993] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem5.base=15, #t~mem5.offset=0, #t~short7=true, ~list~0.base=12, ~list~0.offset=0] [L993] assume !!#t~short7; [L993] havoc #t~mem6.base, #t~mem6.offset; [L993] havoc #t~short7; [L993] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~list~0.base=12, ~list~0.offset=0] [L995] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L998-L1006] assume !(0 != #t~nondet8); [L998] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1008] ~end~0.base, ~end~0.offset := 0, 0; [L1009] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1012] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1014-L1034] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1016] ~len~0 := 0; [L1017] call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); [L1017] ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; [L1017] havoc #t~mem18.base, #t~mem18.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=0, ~list~0.base=12, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=0, ~list~0.base=12, ~list~0.offset=0] [L1020-L1023] assume 0 == ~len~0; [L1021] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem19.base=0, #t~mem19.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1025] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1026] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1026] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1026] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1027] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [L1027] ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; [L1027] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1028-L1029] assume 1 == ~len~0; [L1029] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [L1029] ~inner~0.base, ~inner~0.offset := #t~mem22.base, #t~mem22.offset; [L1029] havoc #t~mem22.base, #t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1020-L1023] assume !(0 == ~len~0); [L1023] ~len~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem19.base=13, #t~mem19.offset=10, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=14, #NULL.offset=9, old(#NULL.base)=14, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L991] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L991] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L992] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=12, ~list~0.offset=0] [L993] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); [L993] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L993] havoc #t~mem3.base, #t~mem3.offset; [L993] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); [L993] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~list~0.base=12, ~list~0.offset=0] [L993] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); [L993] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem5.base=15, #t~mem5.offset=0, #t~short7=true, ~list~0.base=12, ~list~0.offset=0] [L993] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem5.base=15, #t~mem5.offset=0, #t~short7=true, ~list~0.base=12, ~list~0.offset=0] [L993] assume !!#t~short7; [L993] havoc #t~mem6.base, #t~mem6.offset; [L993] havoc #t~short7; [L993] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~list~0.base=12, ~list~0.offset=0] [L995] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L998-L1006] assume !(0 != #t~nondet8); [L998] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1008] ~end~0.base, ~end~0.offset := 0, 0; [L1009] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1012] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~list~0.base=12, ~list~0.offset=0] [L1014-L1034] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1016] ~len~0 := 0; [L1017] call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); [L1017] ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; [L1017] havoc #t~mem18.base, #t~mem18.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=0, ~list~0.base=12, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=0, ~list~0.base=12, ~list~0.offset=0] [L1020-L1023] assume 0 == ~len~0; [L1021] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem19.base=0, #t~mem19.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1025] assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1026] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1026] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1026] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=15, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1027] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [L1027] ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; [L1027] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=0, ~inner~0.offset=0, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1028-L1029] assume 1 == ~len~0; [L1029] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); [L1029] ~inner~0.base, ~inner~0.offset := #t~mem22.base, #t~mem22.offset; [L1029] havoc #t~mem22.base, #t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1018-L1030] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=1, ~list~0.base=12, ~list~0.offset=0] [L1020-L1023] assume !(0 == ~len~0); [L1023] ~len~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1024] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem19.base=13, #t~mem19.offset=10, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); [L1025] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [L1025] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~end~0.base=12, ~end~0.offset=0, ~inner~0.base=11, ~inner~0.offset=1, ~len~0=2, ~list~0.base=12, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; [L992] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L993] havoc #t~mem3; [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem6; [L993] havoc #t~short7; [L993] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1029] ~inner~0 := #t~mem22; [L1029] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1020] COND FALSE !(0 == ~len~0) [L1023] ~len~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=13, #t~mem19!offset=10, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] COND TRUE !({ base: 0, offset: 0 } == #t~mem19) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; [L992] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L993] havoc #t~mem3; [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem6; [L993] havoc #t~short7; [L993] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1029] ~inner~0 := #t~mem22; [L1029] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1020] COND FALSE !(0 == ~len~0) [L1023] ~len~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=13, #t~mem19!offset=10, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] COND TRUE !({ base: 0, offset: 0 } == #t~mem19) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; [L992] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L993] havoc #t~mem3; [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem6; [L993] havoc #t~short7; [L993] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1029] ~inner~0 := #t~mem22; [L1029] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1020] COND FALSE !(0 == ~len~0) [L1023] ~len~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=13, #t~mem19!offset=10, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] COND TRUE !({ base: 0, offset: 0 } == #t~mem19) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L991] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L991] ~list~0 := #t~malloc0; [L992] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(0 != #t~nondet1) [L993] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L993] havoc #t~mem3; [L993] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L993] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L993] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L993] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem5!base=15, #t~mem5!offset=0, #t~short7=true, ~list~0!base=12, ~list~0!offset=0] [L993] COND FALSE !(!#t~short7) [L993] havoc #t~mem6; [L993] havoc #t~short7; [L993] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~list~0!base=12, ~list~0!offset=0] [L995] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L998-L1006] COND TRUE !(0 != #t~nondet8) [L998] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1008] ~end~0 := { base: 0, offset: 0 }; [L1009] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1012] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~list~0!base=12, ~list~0!offset=0] [L1014-L1034] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1016] ~len~0 := 0; [L1017] FCALL call #t~mem18 := read~$Pointer$({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1017] ~inner~0 := #t~mem18; [L1017] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=0, ~list~0!base=12, ~list~0!offset=0] [L1020] COND TRUE 0 == ~len~0 [L1021] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=0, #t~mem19!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1025] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem19)) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1026] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1026] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=15, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1027] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1027] ~inner~0 := #t~mem21; [L1027] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=0, ~inner~0!offset=0, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1028] COND TRUE 1 == ~len~0 [L1029] FCALL call #t~mem22 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); [L1029] ~inner~0 := #t~mem22; [L1029] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1018-L1030] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=1, ~list~0!base=12, ~list~0!offset=0] [L1020] COND FALSE !(0 == ~len~0) [L1023] ~len~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1024] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] FCALL call #t~mem19 := read~$Pointer$({ base: ~inner~0!base, offset: 4 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem19!base=13, #t~mem19!offset=10, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] COND TRUE !({ base: 0, offset: 0 } == #t~mem19) [L1025] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L1025] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~end~0!base=12, ~end~0!offset=0, ~inner~0!base=11, ~inner~0!offset=1, ~len~0=2, ~list~0!base=12, ~list~0!offset=0] [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={12:0}, list->inner={15:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={15:0}, len=0, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={15:0}, inner->inner={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={12:0}, inner={15:0}, inner->next={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={11:1}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={11:1}, inner->inner={13:10}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] ----- [2018-11-23 02:30:55,568 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_178ff2ed-219b-4685-a194-e40e3f7f2cbf/bin-2019/uautomizer/witness.graphml [2018-11-23 02:30:55,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:30:55,569 INFO L168 Benchmark]: Toolchain (without parser) took 10874.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.1 MB). Free memory was 956.4 MB in the beginning and 1.3 GB in the end (delta: -382.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:30:55,570 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:30:55,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:30:55,570 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:30:55,570 INFO L168 Benchmark]: Boogie Preprocessor took 30.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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:30:55,570 INFO L168 Benchmark]: RCFGBuilder took 349.05 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: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:30:55,571 INFO L168 Benchmark]: TraceAbstraction took 9887.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -273.8 MB). Peak memory consumption was 494.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:30:55,571 INFO L168 Benchmark]: Witness Printer took 244.38 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:30:55,572 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 349.05 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: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9887.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -273.8 MB). Peak memory consumption was 494.8 MB. Max. memory is 11.5 GB. * Witness Printer took 244.38 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={12:0}, list->inner={15:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={15:0}, len=0, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={15:0}, inner->inner={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={12:0}, inner={15:0}, inner->next={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={11:1}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={11:1}, inner->inner={13:10}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 13 error locations. UNSAFE Result, 9.8s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1769 SDtfs, 3581 SDslu, 4347 SDs, 0 SdLazy, 2521 SolverSat, 365 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 171 SyntacticMatches, 14 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 1362 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 800 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 734 ConstructedInterpolants, 15 QuantifiedInterpolants, 411074 SizeOfPredicates, 45 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 26 InterpolantComputations, 18 PerfectInterpolantSequences, 10/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...