./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.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_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/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 9d5c9e73019496cf8de6b5e77c9588d54710972f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:04:46,129 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:46,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:46,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:46,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:46,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:46,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:46,141 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:46,142 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:46,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:46,143 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:46,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:46,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:46,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:46,145 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:46,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:46,146 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:46,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:46,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:46,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:46,150 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:46,151 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:46,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:46,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:46,153 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:46,153 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:46,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:46,155 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:46,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:46,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:46,156 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:46,156 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:46,157 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:46,157 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:46,158 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:46,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:46,158 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:04:46,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:46,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:46,169 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:46,169 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:46,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:46,170 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:46,170 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:46,170 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:46,170 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:46,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:46,170 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:46,170 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:46,171 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:46,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:46,171 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:46,171 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:46,171 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:46,171 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:46,171 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:46,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:46,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:46,172 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:46,172 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:46,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:46,172 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:46,172 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:46,172 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:46,173 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:46,173 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:46,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:46,173 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_70e543a1-2066-4f63-a64c-4bce2069a2dc/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 -> 9d5c9e73019496cf8de6b5e77c9588d54710972f [2018-11-23 13:04:46,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:46,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:46,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:46,209 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:46,209 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:46,210 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:04:46,255 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/data/50225b8ef/12ca15eb520f417cbd7a6dd922255780/FLAG7ecb6c3ac [2018-11-23 13:04:46,618 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:46,618 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:04:46,626 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/data/50225b8ef/12ca15eb520f417cbd7a6dd922255780/FLAG7ecb6c3ac [2018-11-23 13:04:47,014 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/data/50225b8ef/12ca15eb520f417cbd7a6dd922255780 [2018-11-23 13:04:47,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:47,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:47,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:47,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:47,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:47,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6168ca26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47, skipping insertion in model container [2018-11-23 13:04:47,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:47,058 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:47,246 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:47,254 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:47,283 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:47,353 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:47,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47 WrapperNode [2018-11-23 13:04:47,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:47,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:47,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:47,354 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:47,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:47,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:47,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:47,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:47,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:47,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:47,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:47,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:47,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/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 13:04:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:04:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:04:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 13:04:47,429 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 13:04:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:04:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:47,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:47,429 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:04:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:04:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:47,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:47,607 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:47,607 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 13:04:47,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:47 BoogieIcfgContainer [2018-11-23 13:04:47,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:47,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:47,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:47,610 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:47,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:47" (1/3) ... [2018-11-23 13:04:47,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c21046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:47, skipping insertion in model container [2018-11-23 13:04:47,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (2/3) ... [2018-11-23 13:04:47,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c21046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:47, skipping insertion in model container [2018-11-23 13:04:47,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:47" (3/3) ... [2018-11-23 13:04:47,612 INFO L112 eAbstractionObserver]: Analyzing ICFG list_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:04:47,618 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:47,623 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:47,632 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:47,651 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:47,651 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:47,651 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:47,651 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:47,651 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:47,652 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:47,652 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:47,652 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:47,652 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 13:04:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:04:47,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:47,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:47,670 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:47,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:47,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1232701293, now seen corresponding path program 1 times [2018-11-23 13:04:47,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:47,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:47,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:47,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:47,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:47,756 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 13:04:47,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:47,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:47,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:47,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:47,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:47,768 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 13:04:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:47,782 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2018-11-23 13:04:47,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:47,783 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 13:04:47,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:47,790 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:04:47,790 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:04:47,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:04:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:04:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:04:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 13:04:47,813 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-11-23 13:04:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:47,814 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 13:04:47,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 13:04:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:04:47,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:47,815 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 13:04:47,815 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:47,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:47,815 INFO L82 PathProgramCache]: Analyzing trace with hash -921255067, now seen corresponding path program 1 times [2018-11-23 13:04:47,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:47,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:47,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:47,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:47,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:47,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:47,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:04:47,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:47,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:47,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:47,929 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-23 13:04:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:48,019 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-23 13:04:48,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:48,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 13:04:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:48,021 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:04:48,021 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:04:48,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:04:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-11-23 13:04:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:04:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 13:04:48,026 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2018-11-23 13:04:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:48,027 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 13:04:48,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 13:04:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:04:48,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:48,027 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] [2018-11-23 13:04:48,028 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:48,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:48,028 INFO L82 PathProgramCache]: Analyzing trace with hash -514179872, now seen corresponding path program 1 times [2018-11-23 13:04:48,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:48,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:48,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:48,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:48,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:48,095 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 13:04:48,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:48,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:04:48,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:48,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:48,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:48,096 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 5 states. [2018-11-23 13:04:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:48,167 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 13:04:48,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:48,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 13:04:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:48,168 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:04:48,168 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:04:48,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:04:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2018-11-23 13:04:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:04:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 13:04:48,172 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2018-11-23 13:04:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:48,172 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 13:04:48,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 13:04:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:04:48,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:48,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] [2018-11-23 13:04:48,173 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:48,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash 510523104, now seen corresponding path program 1 times [2018-11-23 13:04:48,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:48,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:48,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:48,238 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 13:04:48,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:48,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:04:48,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:48,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:48,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:48,239 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 5 states. [2018-11-23 13:04:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:48,308 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 13:04:48,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:48,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 13:04:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:48,309 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:04:48,309 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:04:48,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:04:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-11-23 13:04:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:04:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 13:04:48,313 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2018-11-23 13:04:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:48,313 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 13:04:48,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 13:04:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:04:48,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:48,314 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] [2018-11-23 13:04:48,314 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:48,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash 435761036, now seen corresponding path program 1 times [2018-11-23 13:04:48,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:48,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:48,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:48,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:48,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:48,423 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 13:04:48,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:48,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/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 13:04:48,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:48,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:48,495 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 13:04:48,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 13:04:48,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:48,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:48,523 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 13:04:48,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,532 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:04:48,534 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 13:04:48,534 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,541 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-23 13:04:48,558 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 13:04:48,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:48,562 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 22 treesize of output 14 [2018-11-23 13:04:48,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 13:04:48,602 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 19 treesize of output 20 [2018-11-23 13:04:48,604 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 13:04:48,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:04:48,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 13:04:48,632 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 22 treesize of output 20 [2018-11-23 13:04:48,634 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 13:04:48,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,640 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 5 treesize of output 1 [2018-11-23 13:04:48,640 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,645 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 13:04:48,652 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 13:04:48,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:48,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 13:04:48,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:04:48,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:04:48,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:04:48,677 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 10 states. [2018-11-23 13:04:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:48,832 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 13:04:48,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:04:48,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:04:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:48,833 INFO L225 Difference]: With dead ends: 54 [2018-11-23 13:04:48,833 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:04:48,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:04:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:04:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-11-23 13:04:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:04:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 13:04:48,836 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2018-11-23 13:04:48,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:48,837 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 13:04:48,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:04:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 13:04:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:04:48,838 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:48,838 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] [2018-11-23 13:04:48,838 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:48,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:48,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1299162700, now seen corresponding path program 1 times [2018-11-23 13:04:48,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:48,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:48,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:48,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:48,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:48,919 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 13:04:48,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:48,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/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 13:04:48,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:48,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:48,949 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 13:04:48,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 13:04:48,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:48,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:48,959 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 13:04:48,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:04:48,967 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 13:04:48,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,969 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,973 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-23 13:04:48,982 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 13:04:48,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:48,985 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 22 treesize of output 14 [2018-11-23 13:04:48,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:48,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 13:04:49,006 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 19 treesize of output 20 [2018-11-23 13:04:49,008 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 13:04:49,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:04:49,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 13:04:49,034 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 22 treesize of output 20 [2018-11-23 13:04:49,036 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 13:04:49,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,045 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 5 treesize of output 1 [2018-11-23 13:04:49,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,050 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 13:04:49,060 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 13:04:49,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:49,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 13:04:49,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:04:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:04:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:04:49,075 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 10 states. [2018-11-23 13:04:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:49,193 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 13:04:49,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:04:49,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:04:49,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:49,194 INFO L225 Difference]: With dead ends: 63 [2018-11-23 13:04:49,194 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 13:04:49,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:04:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 13:04:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2018-11-23 13:04:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:04:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-23 13:04:49,199 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2018-11-23 13:04:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:49,199 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-23 13:04:49,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:04:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 13:04:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:04:49,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:49,200 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:49,200 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:49,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:49,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1067059897, now seen corresponding path program 1 times [2018-11-23 13:04:49,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:49,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:49,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:49,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:49,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:49,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:49,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/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 13:04:49,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:49,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:49,359 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 13:04:49,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 13:04:49,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:49,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:49,379 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 13:04:49,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-23 13:04:49,402 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:04:49,405 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 13:04:49,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,415 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:04:49,417 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 13:04:49,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,424 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 13:04:49,424 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2018-11-23 13:04:49,449 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 130 treesize of output 124 [2018-11-23 13:04:49,452 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 36 treesize of output 1 [2018-11-23 13:04:49,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,475 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 75 treesize of output 76 [2018-11-23 13:04:49,477 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 36 treesize of output 1 [2018-11-23 13:04:49,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,486 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 13:04:49,487 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 20 treesize of output 19 [2018-11-23 13:04:49,488 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,489 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,492 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-11-23 13:04:49,506 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 39 treesize of output 33 [2018-11-23 13:04:49,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 18 [2018-11-23 13:04:49,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 13:04:49,530 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 19 treesize of output 7 [2018-11-23 13:04:49,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,536 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 13:04:49,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2018-11-23 13:04:49,538 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 13:04:49,540 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 13:04:49,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 13:04:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:49,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:49,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 13:04:49,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:04:49,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:04:49,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:04:49,563 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 14 states. [2018-11-23 13:04:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:49,755 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-11-23 13:04:49,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:04:49,755 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-23 13:04:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:49,755 INFO L225 Difference]: With dead ends: 67 [2018-11-23 13:04:49,755 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 13:04:49,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:04:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 13:04:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2018-11-23 13:04:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:04:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-11-23 13:04:49,761 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 26 [2018-11-23 13:04:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:49,761 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-23 13:04:49,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:04:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2018-11-23 13:04:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:04:49,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:49,762 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:49,762 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:49,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash 501952563, now seen corresponding path program 2 times [2018-11-23 13:04:49,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:49,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:49,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:49,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:49,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:49,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:49,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/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 13:04:49,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:49,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:49,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:49,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:49,945 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 13:04:49,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 13:04:49,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:49,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:49,983 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 13:04:49,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:49,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:04:50,000 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 13:04:50,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,002 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,008 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-23 13:04:50,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 13:04:50,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:50,028 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 22 treesize of output 14 [2018-11-23 13:04:50,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 13:04:50,065 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 19 treesize of output 20 [2018-11-23 13:04:50,067 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 13:04:50,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2018-11-23 13:04:50,094 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 34 treesize of output 33 [2018-11-23 13:04:50,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:50,103 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 22 treesize of output 14 [2018-11-23 13:04:50,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:04:50,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-11-23 13:04:50,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:50,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-23 13:04:50,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:50,164 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 2 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 13:04:50,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 13:04:50,231 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 23 treesize of output 22 [2018-11-23 13:04:50,231 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:50,259 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 24 treesize of output 18 [2018-11-23 13:04:50,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:04:50,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 13:04:50,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-23 13:04:50,408 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 22 treesize of output 20 [2018-11-23 13:04:50,410 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 13:04:50,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,418 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 5 treesize of output 1 [2018-11-23 13:04:50,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,423 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-23 13:04:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:50,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:50,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-23 13:04:50,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:04:50,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:04:50,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:04:50,457 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 17 states. [2018-11-23 13:04:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:50,873 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-11-23 13:04:50,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:04:50,873 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-11-23 13:04:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:50,874 INFO L225 Difference]: With dead ends: 93 [2018-11-23 13:04:50,874 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 13:04:50,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:04:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 13:04:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 60. [2018-11-23 13:04:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:04:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-11-23 13:04:50,879 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 28 [2018-11-23 13:04:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:50,879 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-11-23 13:04:50,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:04:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-23 13:04:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:04:50,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:50,880 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:04:50,880 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:50,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:50,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1101299266, now seen corresponding path program 1 times [2018-11-23 13:04:50,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:50,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:50,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:50,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:50,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:50,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:50,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:50,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:50,982 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 13:04:50,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:50,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 13:04:51,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:51,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:51,006 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 13:04:51,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-23 13:04:51,041 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:04:51,043 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 13:04:51,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,057 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:04:51,059 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 13:04:51,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,067 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 13:04:51,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2018-11-23 13:04:51,091 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 120 treesize of output 121 [2018-11-23 13:04:51,100 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 36 treesize of output 1 [2018-11-23 13:04:51,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,118 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 13:04:51,121 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 20 treesize of output 19 [2018-11-23 13:04:51,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,138 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 75 treesize of output 69 [2018-11-23 13:04:51,141 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 36 treesize of output 1 [2018-11-23 13:04:51,141 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,151 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,155 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-11-23 13:04:51,167 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 39 treesize of output 33 [2018-11-23 13:04:51,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 18 [2018-11-23 13:04:51,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 13:04:51,183 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 19 treesize of output 7 [2018-11-23 13:04:51,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,191 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 13:04:51,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2018-11-23 13:04:51,201 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 13:04:51,203 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 13:04:51,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 13:04:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:51,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:51,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 13:04:51,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:04:51,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:04:51,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:04:51,241 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 14 states. [2018-11-23 13:04:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:51,435 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2018-11-23 13:04:51,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:04:51,436 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 13:04:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:51,437 INFO L225 Difference]: With dead ends: 82 [2018-11-23 13:04:51,437 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 13:04:51,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:04:51,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 13:04:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57. [2018-11-23 13:04:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:04:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-11-23 13:04:51,443 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 28 [2018-11-23 13:04:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:51,443 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-11-23 13:04:51,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:04:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-23 13:04:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:04:51,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:51,444 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:51,444 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:51,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:51,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2126002242, now seen corresponding path program 2 times [2018-11-23 13:04:51,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:51,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:51,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:51,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:51,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:51,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:51,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:51,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:51,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:51,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:51,579 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 13:04:51,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 13:04:51,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:51,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:51,594 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 13:04:51,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-23 13:04:51,607 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:04:51,608 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 8 treesize of output 7 [2018-11-23 13:04:51,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,622 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:04:51,624 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 13:04:51,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,631 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 13:04:51,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2018-11-23 13:04:51,643 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 130 treesize of output 124 [2018-11-23 13:04:51,646 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 36 treesize of output 1 [2018-11-23 13:04:51,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,672 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 13:04:51,674 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 20 treesize of output 19 [2018-11-23 13:04:51,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,689 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 65 treesize of output 66 [2018-11-23 13:04:51,694 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 36 treesize of output 1 [2018-11-23 13:04:51,694 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,698 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,703 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:133, output treesize:33 [2018-11-23 13:04:51,716 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 37 treesize of output 31 [2018-11-23 13:04:51,717 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:04:51,718 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 31 treesize of output 23 [2018-11-23 13:04:51,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 13:04:51,727 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:04:51,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 13:04:51,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,732 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 13:04:51,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2018-11-23 13:04:51,738 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 13:04:51,739 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 13:04:51,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:51,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 13:04:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:51,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:51,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:04:51,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:04:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:04:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:04:51,773 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 10 states. [2018-11-23 13:04:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:51,898 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-11-23 13:04:51,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:04:51,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-11-23 13:04:51,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:51,899 INFO L225 Difference]: With dead ends: 77 [2018-11-23 13:04:51,899 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 13:04:51,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:04:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 13:04:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2018-11-23 13:04:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:04:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-23 13:04:51,903 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 28 [2018-11-23 13:04:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:51,903 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-23 13:04:51,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:04:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-23 13:04:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:04:51,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:51,904 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:51,904 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:51,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash 801654515, now seen corresponding path program 1 times [2018-11-23 13:04:51,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:51,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:51,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:52,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:52,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:52,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:52,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:52,062 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 13:04:52,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 13:04:52,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:52,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:52,082 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 13:04:52,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,090 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 13:04:52,091 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 13:04:52,091 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,097 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2018-11-23 13:04:52,113 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 13:04:52,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:52,116 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 22 treesize of output 14 [2018-11-23 13:04:52,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2018-11-23 13:04:52,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:52,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:52,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:52,139 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 16 treesize of output 13 [2018-11-23 13:04:52,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,147 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 13:04:52,148 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 13:04:52,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,156 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2018-11-23 13:04:52,172 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 13:04:52,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:52,175 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 22 treesize of output 14 [2018-11-23 13:04:52,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:04:52,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2018-11-23 13:04:52,204 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 26 treesize of output 35 [2018-11-23 13:04:52,206 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 13:04:52,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 13:04:52,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2018-11-23 13:04:52,236 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 29 treesize of output 33 [2018-11-23 13:04:52,238 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 5 treesize of output 1 [2018-11-23 13:04:52,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,246 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 5 treesize of output 1 [2018-11-23 13:04:52,246 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,249 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 13:04:52,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2018-11-23 13:04:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:52,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:52,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-11-23 13:04:52,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:04:52,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:04:52,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:04:52,279 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 20 states. [2018-11-23 13:04:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:52,706 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2018-11-23 13:04:52,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:04:52,707 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-11-23 13:04:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:52,708 INFO L225 Difference]: With dead ends: 100 [2018-11-23 13:04:52,708 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 13:04:52,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:04:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 13:04:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2018-11-23 13:04:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:04:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-23 13:04:52,716 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 28 [2018-11-23 13:04:52,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:52,716 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-23 13:04:52,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:04:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 13:04:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:04:52,717 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:52,717 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:52,717 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:52,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1388752430, now seen corresponding path program 1 times [2018-11-23 13:04:52,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:52,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:52,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:52,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:52,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:52,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:52,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:52,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:52,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:52,991 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 13:04:52,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:52,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 13:04:53,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:53,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:53,019 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 13:04:53,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,029 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:04:53,031 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 13:04:53,031 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,033 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,040 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-23 13:04:53,052 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 13:04:53,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:53,055 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 22 treesize of output 14 [2018-11-23 13:04:53,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 13:04:53,096 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 19 treesize of output 20 [2018-11-23 13:04:53,098 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 13:04:53,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2018-11-23 13:04:53,123 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 34 treesize of output 33 [2018-11-23 13:04:53,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:53,127 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 22 treesize of output 14 [2018-11-23 13:04:53,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:04:53,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-11-23 13:04:53,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:53,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-23 13:04:53,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:53,182 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 2 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 13:04:53,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 13:04:53,236 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 23 treesize of output 22 [2018-11-23 13:04:53,237 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:53,267 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 24 treesize of output 18 [2018-11-23 13:04:53,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:04:53,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 13:04:53,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-23 13:04:53,354 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 26 treesize of output 24 [2018-11-23 13:04:53,357 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 13:04:53,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,365 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 5 treesize of output 1 [2018-11-23 13:04:53,365 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:53,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:53,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 13:04:53,386 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 13:04:53,387 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 13:04:53,392 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 5 treesize of output 1 [2018-11-23 13:04:53,392 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,394 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:53,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:04:53,399 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:53, output treesize:7 [2018-11-23 13:04:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:53,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:53,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 16 [2018-11-23 13:04:53,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:04:53,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:04:53,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:04:53,430 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 16 states. [2018-11-23 13:04:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:53,795 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-11-23 13:04:53,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:04:53,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-11-23 13:04:53,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:53,796 INFO L225 Difference]: With dead ends: 90 [2018-11-23 13:04:53,796 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 13:04:53,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:04:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 13:04:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2018-11-23 13:04:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:04:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-11-23 13:04:53,801 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 30 [2018-11-23 13:04:53,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:53,801 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-11-23 13:04:53,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:04:53,801 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-11-23 13:04:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:04:53,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:53,802 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:53,802 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:53,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:53,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1881511890, now seen corresponding path program 3 times [2018-11-23 13:04:53,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:53,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:53,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:53,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:53,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:53,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:53,967 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:53,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:04:53,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:04:53,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:53,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:54,001 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 13:04:54,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 13:04:54,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:54,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:54,020 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 13:04:54,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-23 13:04:54,051 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:04:54,054 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 8 treesize of output 7 [2018-11-23 13:04:54,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,064 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:04:54,066 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 13:04:54,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,073 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 13:04:54,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-11-23 13:04:54,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:54,094 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 31 treesize of output 32 [2018-11-23 13:04:54,096 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 15 [2018-11-23 13:04:54,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:54,116 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 30 treesize of output 35 [2018-11-23 13:04:54,137 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 16 treesize of output 19 [2018-11-23 13:04:54,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,157 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 12 [2018-11-23 13:04:54,159 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 15 [2018-11-23 13:04:54,159 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,162 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,171 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:77, output treesize:51 [2018-11-23 13:04:54,211 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 129 treesize of output 130 [2018-11-23 13:04:54,213 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 18 treesize of output 17 [2018-11-23 13:04:54,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,240 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 122 treesize of output 118 [2018-11-23 13:04:54,242 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 18 treesize of output 17 [2018-11-23 13:04:54,242 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,261 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2018-11-23 13:04:54,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:54,264 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 42 treesize of output 30 [2018-11-23 13:04:54,264 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,266 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,274 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:140, output treesize:68 [2018-11-23 13:04:54,319 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 150 [2018-11-23 13:04:54,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:54,327 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 131 treesize of output 152 [2018-11-23 13:04:54,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,540 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 148 treesize of output 108 [2018-11-23 13:04:54,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 111 [2018-11-23 13:04:54,586 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 110 treesize of output 70 [2018-11-23 13:04:54,586 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,606 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:54,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 82 [2018-11-23 13:04:54,625 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 73 treesize of output 57 [2018-11-23 13:04:54,625 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:54,642 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 39 treesize of output 50 [2018-11-23 13:04:54,643 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,654 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:04:54,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 13:04:54,668 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:162, output treesize:134 [2018-11-23 13:04:54,761 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 79 treesize of output 69 [2018-11-23 13:04:54,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 48 treesize of output 35 [2018-11-23 13:04:54,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:54,789 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 52 treesize of output 44 [2018-11-23 13:04:54,791 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 23 treesize of output 7 [2018-11-23 13:04:54,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,797 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 13:04:54,797 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,816 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 90 treesize of output 80 [2018-11-23 13:04:54,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 59 treesize of output 46 [2018-11-23 13:04:54,819 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,834 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,864 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 67 treesize of output 53 [2018-11-23 13:04:54,866 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 23 treesize of output 7 [2018-11-23 13:04:54,866 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,877 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 20 treesize of output 11 [2018-11-23 13:04:54,878 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,885 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:54,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 13:04:54,899 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:170, output treesize:48 [2018-11-23 13:04:55,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:55,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:04:55,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 13:04:55,015 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 13:04:55,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 13:04:55,024 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 5 treesize of output 1 [2018-11-23 13:04:55,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:55,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:55,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:55,029 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-11-23 13:04:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:55,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:55,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-11-23 13:04:55,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:04:55,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:04:55,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:04:55,062 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 22 states. [2018-11-23 13:04:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,771 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2018-11-23 13:04:55,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:04:55,771 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-11-23 13:04:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:55,772 INFO L225 Difference]: With dead ends: 105 [2018-11-23 13:04:55,772 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 13:04:55,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:04:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 13:04:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 73. [2018-11-23 13:04:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 13:04:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2018-11-23 13:04:55,780 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 30 [2018-11-23 13:04:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:55,781 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2018-11-23 13:04:55,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:04:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2018-11-23 13:04:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:04:55,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:55,782 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:04:55,782 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:55,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:55,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1639519470, now seen corresponding path program 1 times [2018-11-23 13:04:55,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:55,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:55,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:55,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:04:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:04:55,815 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=16, |#NULL.offset|=9, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] RET #99#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~nondet4|=1] [?] assume !!(0 != #t~nondet4);havoc #t~nondet4;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=11, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=11, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0, |main_#t~nondet4|=0] [?] assume !(0 != #t~nondet4);havoc #t~nondet4; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=11, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0, |main_#t~mem7|=1] [?] assume !(2 == #t~mem7);havoc #t~mem7; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0, |main_#t~mem9|=1] [?] assume !!(1 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0, |main_#t~mem9|=2] [?] assume !(1 == #t~mem9);havoc #t~mem9; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0, |main_#t~mem11|=2] [?] assume 3 != #t~mem11;havoc #t~mem11; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] assume !false; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=9, old(#NULL.base)=16, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0] [L631-L637] assume !!(0 != #t~nondet1); [L631] havoc #t~nondet1; [L632] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L633] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L633] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L634] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L635] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L636] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L636] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L636] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L631-L637] assume !(0 != #t~nondet1); [L631] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet4=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L638-L644] assume !!(0 != #t~nondet4); [L638] havoc #t~nondet4; [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8); [L640] ~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L641] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L642] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L643] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset; [L643] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~nondet4=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L638-L644] assume !(0 != #t~nondet4); [L638] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L645] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L646] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L647] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem7=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L647-L648] assume !(2 == #t~mem7); [L647] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem9=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649-L650] assume !!(1 == #t~mem9); [L649] havoc #t~mem9; [L650] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L650] ~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset; [L650] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem9=2, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem9); [L649] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L651] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem11=2, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem11; [L651] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=9, old(#NULL.base)=16, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0] [L631-L637] assume !!(0 != #t~nondet1); [L631] havoc #t~nondet1; [L632] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L633] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L633] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L634] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L635] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L636] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L636] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L636] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L631-L637] assume !(0 != #t~nondet1); [L631] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet4=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L638-L644] assume !!(0 != #t~nondet4); [L638] havoc #t~nondet4; [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8); [L640] ~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L641] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L642] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L643] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset; [L643] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~nondet4=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L638-L644] assume !(0 != #t~nondet4); [L638] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L645] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L646] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L647] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem7=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L647-L648] assume !(2 == #t~mem7); [L647] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem9=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649-L650] assume !!(1 == #t~mem9); [L649] havoc #t~mem9; [L650] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L650] ~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset; [L650] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem9=2, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem9); [L649] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L651] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem11=2, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem11; [L651] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631-L637] COND FALSE !(!(0 != #t~nondet1)) [L631] havoc #t~nondet1; [L632] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L633] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L633] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L634] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L635] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] ~p~0 := #t~mem3; [L636] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631-L637] COND TRUE !(0 != #t~nondet1) [L631] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet4=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638-L644] COND FALSE !(!(0 != #t~nondet4)) [L638] havoc #t~nondet4; [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call #t~malloc5 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem6; [L643] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~nondet4=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638-L644] COND TRUE !(0 != #t~nondet4) [L638] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem7=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647-L648] COND TRUE !(2 == #t~mem7) [L647] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND FALSE !(!(1 == #t~mem9)) [L649] havoc #t~mem9; [L650] FCALL call #t~mem10 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L650] ~p~0 := #t~mem10; [L650] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem9) [L649] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem11=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem11 [L651] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631-L637] COND FALSE !(!(0 != #t~nondet1)) [L631] havoc #t~nondet1; [L632] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L633] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L633] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L634] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L635] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] ~p~0 := #t~mem3; [L636] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631-L637] COND TRUE !(0 != #t~nondet1) [L631] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet4=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638-L644] COND FALSE !(!(0 != #t~nondet4)) [L638] havoc #t~nondet4; [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call #t~malloc5 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem6; [L643] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~nondet4=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638-L644] COND TRUE !(0 != #t~nondet4) [L638] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem7=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647-L648] COND TRUE !(2 == #t~mem7) [L647] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND FALSE !(!(1 == #t~mem9)) [L649] havoc #t~mem9; [L650] FCALL call #t~mem10 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L650] ~p~0 := #t~mem10; [L650] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem9) [L649] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem11=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem11 [L651] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631-L637] COND FALSE !(!(0 != #t~nondet1)) [L631] havoc #t~nondet1; [L632] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L633] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L633] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L634] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L635] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] ~p~0 := #t~mem3; [L636] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631-L637] COND TRUE !(0 != #t~nondet1) [L631] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet4=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638-L644] COND FALSE !(!(0 != #t~nondet4)) [L638] havoc #t~nondet4; [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call #t~malloc5 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem6; [L643] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~nondet4=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638-L644] COND TRUE !(0 != #t~nondet4) [L638] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem7=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647-L648] COND TRUE !(2 == #t~mem7) [L647] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND FALSE !(!(1 == #t~mem9)) [L649] havoc #t~mem9; [L650] FCALL call #t~mem10 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L650] ~p~0 := #t~mem10; [L650] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem9) [L649] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem11=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem11 [L651] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631-L637] COND FALSE !(!(0 != #t~nondet1)) [L631] havoc #t~nondet1; [L632] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L633] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L633] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L634] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L635] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] ~p~0 := #t~mem3; [L636] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631-L637] COND TRUE !(0 != #t~nondet1) [L631] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet4=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638-L644] COND FALSE !(!(0 != #t~nondet4)) [L638] havoc #t~nondet4; [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call #t~malloc5 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem6; [L643] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~nondet4=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638-L644] COND TRUE !(0 != #t~nondet4) [L638] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem7=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647-L648] COND TRUE !(2 == #t~mem7) [L647] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND FALSE !(!(1 == #t~mem9)) [L649] havoc #t~mem9; [L650] FCALL call #t~mem10 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L650] ~p~0 := #t~mem10; [L650] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem9) [L649] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem11=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem11 [L651] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={18:0}, malloc(sizeof(struct node))={18:0}] [L628] COND FALSE !(a == 0) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}] [L629] List t; [L630] List p = a; VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, p={18:0}] [L631] COND TRUE __VERIFIER_nondet_int() [L632] p->h = 1 [L633] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, p={18:0}, t={21:0}] [L634] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, p={18:0}, t={21:0}] [L635] p->n = t [L636] EXPR p->n [L636] p = p->n [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND TRUE __VERIFIER_nondet_int() [L639] p->h = 2 [L640] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, t={11:0}] [L641] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, t={11:0}] [L642] p->n = t [L643] EXPR p->n [L643] p = p->n [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] p->h = 3 [L646] p = a VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={18:0}, t={11:0}] [L647] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={18:0}, p->h=1, t={11:0}] [L647] COND FALSE !(p->h == 2) [L649] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={18:0}, p->h=1, t={11:0}] [L649] COND TRUE p->h == 1 [L650] EXPR p->n [L650] p = p->n [L649] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, p->h=2, t={11:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, p->h=2, t={11:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, t={11:0}] ----- [2018-11-23 13:04:55,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:04:55 BoogieIcfgContainer [2018-11-23 13:04:55,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:04:55,882 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:04:55,882 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:04:55,882 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:04:55,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:47" (3/4) ... [2018-11-23 13:04:55,884 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|=16, |#NULL.offset|=9, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] RET #99#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=21, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~nondet4|=1] [?] assume !!(0 != #t~nondet4);havoc #t~nondet4;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=11, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=11, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0, |main_#t~nondet4|=0] [?] assume !(0 != #t~nondet4);havoc #t~nondet4; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=11, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0, |main_#t~mem7|=1] [?] assume !(2 == #t~mem7);havoc #t~mem7; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0, |main_#t~mem9|=1] [?] assume !!(1 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0, |main_#t~mem9|=2] [?] assume !(1 == #t~mem9);havoc #t~mem9; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0, |main_#t~mem11|=2] [?] assume 3 != #t~mem11;havoc #t~mem11; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] assume !false; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~p~0.base=21, main_~p~0.offset=0, main_~t~0.base=11, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~malloc5.base|=11, |main_#t~malloc5.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=9, old(#NULL.base)=16, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0] [L631-L637] assume !!(0 != #t~nondet1); [L631] havoc #t~nondet1; [L632] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L633] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L633] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L634] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L635] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L636] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L636] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L636] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L631-L637] assume !(0 != #t~nondet1); [L631] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet4=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L638-L644] assume !!(0 != #t~nondet4); [L638] havoc #t~nondet4; [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8); [L640] ~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L641] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L642] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L643] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset; [L643] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~nondet4=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L638-L644] assume !(0 != #t~nondet4); [L638] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L645] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L646] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L647] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem7=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L647-L648] assume !(2 == #t~mem7); [L647] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem9=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649-L650] assume !!(1 == #t~mem9); [L649] havoc #t~mem9; [L650] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L650] ~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset; [L650] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem9=2, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem9); [L649] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L651] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem11=2, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem11; [L651] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=9, old(#NULL.base)=16, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0] [L631-L637] assume !!(0 != #t~nondet1); [L631] havoc #t~nondet1; [L632] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L633] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L633] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L634] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L635] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L636] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L636] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L636] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L631-L637] assume !(0 != #t~nondet1); [L631] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet4=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=21, ~t~0.offset=0] [L638-L644] assume !!(0 != #t~nondet4); [L638] havoc #t~nondet4; [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8); [L640] ~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L641] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L642] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L643] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset; [L643] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~nondet4=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L638-L644] assume !(0 != #t~nondet4); [L638] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=11, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L645] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L646] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L647] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem7=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L647-L648] assume !(2 == #t~mem7); [L647] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem9=1, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649-L650] assume !!(1 == #t~mem9); [L649] havoc #t~mem9; [L650] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L650] ~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset; [L650] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem9=2, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem9); [L649] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L651] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, #t~mem11=2, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem11; [L651] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~malloc5.base=11, #t~malloc5.offset=0, ~a~0.base=18, ~a~0.offset=0, ~p~0.base=21, ~p~0.offset=0, ~t~0.base=11, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631-L637] COND FALSE !(!(0 != #t~nondet1)) [L631] havoc #t~nondet1; [L632] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L633] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L633] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L634] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L635] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] ~p~0 := #t~mem3; [L636] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631-L637] COND TRUE !(0 != #t~nondet1) [L631] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet4=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638-L644] COND FALSE !(!(0 != #t~nondet4)) [L638] havoc #t~nondet4; [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call #t~malloc5 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem6; [L643] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~nondet4=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638-L644] COND TRUE !(0 != #t~nondet4) [L638] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem7=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647-L648] COND TRUE !(2 == #t~mem7) [L647] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND FALSE !(!(1 == #t~mem9)) [L649] havoc #t~mem9; [L650] FCALL call #t~mem10 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L650] ~p~0 := #t~mem10; [L650] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem9) [L649] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem11=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem11 [L651] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631-L637] COND FALSE !(!(0 != #t~nondet1)) [L631] havoc #t~nondet1; [L632] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L633] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L633] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L634] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L635] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] ~p~0 := #t~mem3; [L636] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631-L637] COND TRUE !(0 != #t~nondet1) [L631] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet4=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638-L644] COND FALSE !(!(0 != #t~nondet4)) [L638] havoc #t~nondet4; [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call #t~malloc5 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem6; [L643] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~nondet4=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638-L644] COND TRUE !(0 != #t~nondet4) [L638] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem7=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647-L648] COND TRUE !(2 == #t~mem7) [L647] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND FALSE !(!(1 == #t~mem9)) [L649] havoc #t~mem9; [L650] FCALL call #t~mem10 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L650] ~p~0 := #t~mem10; [L650] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem9) [L649] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem11=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem11 [L651] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631-L637] COND FALSE !(!(0 != #t~nondet1)) [L631] havoc #t~nondet1; [L632] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L633] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L633] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L634] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L635] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] ~p~0 := #t~mem3; [L636] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631-L637] COND TRUE !(0 != #t~nondet1) [L631] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet4=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638-L644] COND FALSE !(!(0 != #t~nondet4)) [L638] havoc #t~nondet4; [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call #t~malloc5 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem6; [L643] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~nondet4=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638-L644] COND TRUE !(0 != #t~nondet4) [L638] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem7=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647-L648] COND TRUE !(2 == #t~mem7) [L647] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND FALSE !(!(1 == #t~mem9)) [L649] havoc #t~mem9; [L650] FCALL call #t~mem10 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L650] ~p~0 := #t~mem10; [L650] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem9) [L649] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem11=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem11 [L651] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0] [L631-L637] COND FALSE !(!(0 != #t~nondet1)) [L631] havoc #t~nondet1; [L632] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L633] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L633] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L634] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L635] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L636] ~p~0 := #t~mem3; [L636] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L631-L637] COND TRUE !(0 != #t~nondet1) [L631] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet4=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=21, ~t~0!offset=0] [L638-L644] COND FALSE !(!(0 != #t~nondet4)) [L638] havoc #t~nondet4; [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call #t~malloc5 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem6; [L643] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~nondet4=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L638-L644] COND TRUE !(0 != #t~nondet4) [L638] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=11, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem7=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L647-L648] COND TRUE !(2 == #t~mem7) [L647] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=1, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND FALSE !(!(1 == #t~mem9)) [L649] havoc #t~mem9; [L650] FCALL call #t~mem10 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L650] ~p~0 := #t~mem10; [L650] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem9=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem9) [L649] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, #t~mem11=2, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem11 [L651] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~malloc5!base=11, #t~malloc5!offset=0, ~a~0!base=18, ~a~0!offset=0, ~p~0!base=21, ~p~0!offset=0, ~t~0!base=11, ~t~0!offset=0] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={18:0}, malloc(sizeof(struct node))={18:0}] [L628] COND FALSE !(a == 0) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}] [L629] List t; [L630] List p = a; VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, p={18:0}] [L631] COND TRUE __VERIFIER_nondet_int() [L632] p->h = 1 [L633] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, p={18:0}, t={21:0}] [L634] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, p={18:0}, t={21:0}] [L635] p->n = t [L636] EXPR p->n [L636] p = p->n [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND TRUE __VERIFIER_nondet_int() [L639] p->h = 2 [L640] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, t={11:0}] [L641] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, t={11:0}] [L642] p->n = t [L643] EXPR p->n [L643] p = p->n [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] p->h = 3 [L646] p = a VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={18:0}, t={11:0}] [L647] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={18:0}, p->h=1, t={11:0}] [L647] COND FALSE !(p->h == 2) [L649] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={18:0}, p->h=1, t={11:0}] [L649] COND TRUE p->h == 1 [L650] EXPR p->n [L650] p = p->n [L649] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, p->h=2, t={11:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, p->h=2, t={11:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, t={11:0}] ----- [2018-11-23 13:04:56,116 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_70e543a1-2066-4f63-a64c-4bce2069a2dc/bin-2019/uautomizer/witness.graphml [2018-11-23 13:04:56,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:04:56,116 INFO L168 Benchmark]: Toolchain (without parser) took 9100.37 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -252.4 MB). Peak memory consumption was 71.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:04:56,117 INFO L168 Benchmark]: CDTParser took 0.14 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 13:04:56,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:04:56,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:04:56,118 INFO L168 Benchmark]: Boogie Preprocessor took 17.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:04:56,118 INFO L168 Benchmark]: RCFGBuilder took 211.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:04:56,118 INFO L168 Benchmark]: TraceAbstraction took 8273.17 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -154.5 MB). Peak memory consumption was 72.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:04:56,118 INFO L168 Benchmark]: Witness Printer took 234.23 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:04:56,119 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 211.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8273.17 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -154.5 MB). Peak memory consumption was 72.5 MB. Max. memory is 11.5 GB. * Witness Printer took 234.23 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 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: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={18:0}, malloc(sizeof(struct node))={18:0}] [L628] COND FALSE !(a == 0) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}] [L629] List t; [L630] List p = a; VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, p={18:0}] [L631] COND TRUE __VERIFIER_nondet_int() [L632] p->h = 1 [L633] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, p={18:0}, t={21:0}] [L634] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, p={18:0}, t={21:0}] [L635] p->n = t [L636] EXPR p->n [L636] p = p->n [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND TRUE __VERIFIER_nondet_int() [L639] p->h = 2 [L640] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, t={11:0}] [L641] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, t={11:0}] [L642] p->n = t [L643] EXPR p->n [L643] p = p->n [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] p->h = 3 [L646] p = a VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={18:0}, t={11:0}] [L647] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={18:0}, p->h=1, t={11:0}] [L647] COND FALSE !(p->h == 2) [L649] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={18:0}, p->h=1, t={11:0}] [L649] COND TRUE p->h == 1 [L650] EXPR p->n [L650] p = p->n [L649] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, p->h=2, t={11:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, p->h=2, t={11:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={11:0}, p={21:0}, t={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. UNSAFE Result, 8.2s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 296 SDtfs, 775 SDslu, 1653 SDs, 0 SdLazy, 2073 SolverSat, 332 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 191 SyntacticMatches, 30 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=13, 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.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 205 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 602 NumberOfCodeBlocks, 602 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 550 ConstructedInterpolants, 31 QuantifiedInterpolants, 170065 SizeOfPredicates, 110 NumberOfNonLiveVariables, 1029 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 20/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...