./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version e943c265
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(TERM)
--- Real Ultimate output ---
This is Ultimate 0.2.1-dev-e943c26
[2021-10-21 19:27:57,986 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-10-21 19:27:57,989 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-21 19:27:58,059 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-21 19:27:58,060 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-21 19:27:58,064 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-21 19:27:58,066 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-21 19:27:58,071 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-21 19:27:58,074 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-21 19:27:58,081 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-21 19:27:58,083 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-10-21 19:27:58,085 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-21 19:27:58,085 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-21 19:27:58,088 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-21 19:27:58,091 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-21 19:27:58,099 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-21 19:27:58,101 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-21 19:27:58,103 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-21 19:27:58,106 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-21 19:27:58,114 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-21 19:27:58,116 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-21 19:27:58,118 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-21 19:27:58,122 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-10-21 19:27:58,123 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-21 19:27:58,133 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-21 19:27:58,134 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-21 19:27:58,134 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-21 19:27:58,136 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-21 19:27:58,137 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-21 19:27:58,139 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-21 19:27:58,139 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-21 19:27:58,140 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-21 19:27:58,142 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-21 19:27:58,144 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-21 19:27:58,145 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-21 19:27:58,146 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-21 19:27:58,146 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-21 19:27:58,147 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-21 19:27:58,147 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-21 19:27:58,148 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-21 19:27:58,149 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-10-21 19:27:58,150 INFO  L101        SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf
[2021-10-21 19:27:58,194 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-10-21 19:27:58,195 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-21 19:27:58,195 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-10-21 19:27:58,196 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-10-21 19:27:58,198 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-21 19:27:58,198 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-10-21 19:27:58,198 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-10-21 19:27:58,198 INFO  L136        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2021-10-21 19:27:58,199 INFO  L138        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2021-10-21 19:27:58,199 INFO  L138        SettingsManager]:  * Use old map elimination=false
[2021-10-21 19:27:58,200 INFO  L138        SettingsManager]:  * Use external solver (rank synthesis)=false
[2021-10-21 19:27:58,200 INFO  L138        SettingsManager]:  * Use only trivial implications for array writes=true
[2021-10-21 19:27:58,200 INFO  L138        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2021-10-21 19:27:58,201 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-21 19:27:58,201 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-10-21 19:27:58,201 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2021-10-21 19:27:58,201 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-10-21 19:27:58,202 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-10-21 19:27:58,202 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-10-21 19:27:58,202 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2021-10-21 19:27:58,202 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2021-10-21 19:27:58,202 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2021-10-21 19:27:58,203 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-10-21 19:27:58,203 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-10-21 19:27:58,203 INFO  L138        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2021-10-21 19:27:58,203 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-10-21 19:27:58,205 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2021-10-21 19:27:58,205 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-21 19:27:58,206 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-10-21 19:27:58,206 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-21 19:27:58,206 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-10-21 19:27:58,206 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-10-21 19:27:58,208 INFO  L136        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2021-10-21 19:27:58,208 INFO  L138        SettingsManager]:  * TransformationType=MODULO_NEIGHBOR
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be
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(F end) )


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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d
[2021-10-21 19:27:58,504 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-21 19:27:58,537 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-21 19:27:58,540 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-21 19:27:58,542 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-10-21 19:27:58,543 INFO  L275        PluginConnector]: CDTParser initialized
[2021-10-21 19:27:58,544 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i
[2021-10-21 19:27:58,644 INFO  L220              CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/data/e257b1b24/9bc7ee4bd955437aa70ca9f796aabd74/FLAG4cb9c59ac
[2021-10-21 19:27:59,295 INFO  L306              CDTParser]: Found 1 translation units.
[2021-10-21 19:27:59,296 INFO  L160              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/sv-benchmarks/c/memsafety-ext/tree_cnstr.i
[2021-10-21 19:27:59,310 INFO  L349              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/data/e257b1b24/9bc7ee4bd955437aa70ca9f796aabd74/FLAG4cb9c59ac
[2021-10-21 19:27:59,551 INFO  L357              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/data/e257b1b24/9bc7ee4bd955437aa70ca9f796aabd74
[2021-10-21 19:27:59,554 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-21 19:27:59,555 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-21 19:27:59,557 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-21 19:27:59,557 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-21 19:27:59,561 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-21 19:27:59,562 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:27:59" (1/1) ...
[2021-10-21 19:27:59,563 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbfbc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:59, skipping insertion in model container
[2021-10-21 19:27:59,563 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:27:59" (1/1) ...
[2021-10-21 19:27:59,571 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-10-21 19:27:59,611 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-10-21 19:27:59,967 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-21 19:27:59,984 INFO  L203         MainTranslator]: Completed pre-run
[2021-10-21 19:28:00,056 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-21 19:28:00,096 INFO  L208         MainTranslator]: Completed translation
[2021-10-21 19:28:00,097 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00 WrapperNode
[2021-10-21 19:28:00,099 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-21 19:28:00,100 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-21 19:28:00,101 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-21 19:28:00,101 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-21 19:28:00,109 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00" (1/1) ...
[2021-10-21 19:28:00,145 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00" (1/1) ...
[2021-10-21 19:28:00,187 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-21 19:28:00,188 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-21 19:28:00,188 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-21 19:28:00,188 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-10-21 19:28:00,199 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00" (1/1) ...
[2021-10-21 19:28:00,200 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00" (1/1) ...
[2021-10-21 19:28:00,220 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00" (1/1) ...
[2021-10-21 19:28:00,221 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00" (1/1) ...
[2021-10-21 19:28:00,240 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00" (1/1) ...
[2021-10-21 19:28:00,245 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00" (1/1) ...
[2021-10-21 19:28:00,248 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00" (1/1) ...
[2021-10-21 19:28:00,259 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-21 19:28:00,260 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-21 19:28:00,260 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-10-21 19:28:00,260 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-10-21 19:28:00,261 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00" (1/1) ...
[2021-10-21 19:28:00,268 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-21 19:28:00,281 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/z3
[2021-10-21 19:28:00,293 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-21 19:28:00,306 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2021-10-21 19:28:00,333 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2021-10-21 19:28:00,334 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2021-10-21 19:28:00,335 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-21 19:28:00,335 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2021-10-21 19:28:00,335 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-21 19:28:00,335 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-21 19:28:00,335 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-21 19:28:00,336 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-21 19:28:00,859 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-21 19:28:00,859 INFO  L299             CfgBuilder]: Removed 8 assume(true) statements.
[2021-10-21 19:28:00,861 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:28:00 BoogieIcfgContainer
[2021-10-21 19:28:00,861 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-21 19:28:00,862 INFO  L113        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2021-10-21 19:28:00,862 INFO  L271        PluginConnector]: Initializing BuchiAutomizer...
[2021-10-21 19:28:00,871 INFO  L275        PluginConnector]: BuchiAutomizer initialized
[2021-10-21 19:28:00,872 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-21 19:28:00,872 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.10 07:27:59" (1/3) ...
[2021-10-21 19:28:00,874 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c2b4ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:28:00, skipping insertion in model container
[2021-10-21 19:28:00,874 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-21 19:28:00,874 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:28:00" (2/3) ...
[2021-10-21 19:28:00,874 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c2b4ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:28:00, skipping insertion in model container
[2021-10-21 19:28:00,874 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-21 19:28:00,875 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:28:00" (3/3) ...
[2021-10-21 19:28:00,876 INFO  L389   chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i
[2021-10-21 19:28:00,936 INFO  L359         BuchiCegarLoop]: Interprodecural is true
[2021-10-21 19:28:00,937 INFO  L360         BuchiCegarLoop]: Hoare is false
[2021-10-21 19:28:00,937 INFO  L361         BuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2021-10-21 19:28:00,937 INFO  L362         BuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-21 19:28:00,937 INFO  L363         BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-21 19:28:00,937 INFO  L364         BuchiCegarLoop]: Difference is false
[2021-10-21 19:28:00,937 INFO  L365         BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-21 19:28:00,938 INFO  L368         BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop========
[2021-10-21 19:28:00,969 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-21 19:28:00,990 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2021-10-21 19:28:00,990 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-21 19:28:00,990 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-21 19:28:00,997 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-21 19:28:00,997 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2021-10-21 19:28:00,997 INFO  L425         BuchiCegarLoop]: ======== Iteration 1============
[2021-10-21 19:28:00,997 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-21 19:28:01,002 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2021-10-21 19:28:01,003 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-21 19:28:01,003 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-21 19:28:01,004 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-21 19:28:01,004 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2021-10-21 19:28:01,010 INFO  L791   eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 17#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 13#L545-2true 
[2021-10-21 19:28:01,011 INFO  L793   eck$LassoCheckResult]: Loop: 13#L545-2true assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 15#L535-2true assume !true; 18#L534-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 19#L540true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 21#L540-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 10#L545true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 13#L545-2true 
[2021-10-21 19:28:01,016 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-21 19:28:01,017 INFO  L82        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2021-10-21 19:28:01,025 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-21 19:28:01,026 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372541869]
[2021-10-21 19:28:01,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-21 19:28:01,027 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-21 19:28:01,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:01,165 INFO  L354             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-21 19:28:01,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:01,217 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-21 19:28:01,221 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-21 19:28:01,221 INFO  L82        PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times
[2021-10-21 19:28:01,221 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-21 19:28:01,222 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491845334]
[2021-10-21 19:28:01,222 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-21 19:28:01,222 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-21 19:28:01,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-21 19:28:01,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-21 19:28:01,267 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-21 19:28:01,268 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491845334]
[2021-10-21 19:28:01,268 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491845334] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-21 19:28:01,269 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-21 19:28:01,269 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-21 19:28:01,269 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569128981]
[2021-10-21 19:28:01,274 INFO  L808   eck$LassoCheckResult]: loop already infeasible
[2021-10-21 19:28:01,275 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-21 19:28:01,288 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2021-10-21 19:28:01,289 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2021-10-21 19:28:01,291 INFO  L87              Difference]: Start difference. First operand  has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-21 19:28:01,298 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-21 19:28:01,298 INFO  L93              Difference]: Finished difference Result 24 states and 35 transitions.
[2021-10-21 19:28:01,298 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-10-21 19:28:01,300 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions.
[2021-10-21 19:28:01,301 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2021-10-21 19:28:01,305 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions.
[2021-10-21 19:28:01,306 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 20
[2021-10-21 19:28:01,306 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 20
[2021-10-21 19:28:01,307 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions.
[2021-10-21 19:28:01,307 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-21 19:28:01,307 INFO  L681         BuchiCegarLoop]: Abstraction has 20 states and 31 transitions.
[2021-10-21 19:28:01,324 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions.
[2021-10-21 19:28:01,332 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2021-10-21 19:28:01,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-21 19:28:01,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions.
[2021-10-21 19:28:01,335 INFO  L704         BuchiCegarLoop]: Abstraction has 20 states and 31 transitions.
[2021-10-21 19:28:01,335 INFO  L587         BuchiCegarLoop]: Abstraction has 20 states and 31 transitions.
[2021-10-21 19:28:01,335 INFO  L425         BuchiCegarLoop]: ======== Iteration 2============
[2021-10-21 19:28:01,335 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions.
[2021-10-21 19:28:01,336 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2021-10-21 19:28:01,337 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-21 19:28:01,337 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-21 19:28:01,337 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-21 19:28:01,337 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-21 19:28:01,337 INFO  L791   eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 61#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 66#L545-2 
[2021-10-21 19:28:01,338 INFO  L793   eck$LassoCheckResult]: Loop: 66#L545-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 62#L535-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 56#L534-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 57#L534-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 58#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 70#L540 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 71#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 65#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 66#L545-2 
[2021-10-21 19:28:01,338 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-21 19:28:01,338 INFO  L82        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times
[2021-10-21 19:28:01,339 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-21 19:28:01,339 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789654851]
[2021-10-21 19:28:01,339 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-21 19:28:01,339 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-21 19:28:01,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:01,358 INFO  L354             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-21 19:28:01,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:01,380 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-21 19:28:01,381 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-21 19:28:01,381 INFO  L82        PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times
[2021-10-21 19:28:01,381 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-21 19:28:01,381 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129378500]
[2021-10-21 19:28:01,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-21 19:28:01,382 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-21 19:28:01,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-21 19:28:01,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-21 19:28:01,556 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-21 19:28:01,556 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129378500]
[2021-10-21 19:28:01,558 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129378500] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-21 19:28:01,559 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-21 19:28:01,559 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-21 19:28:01,560 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967641439]
[2021-10-21 19:28:01,561 INFO  L808   eck$LassoCheckResult]: loop already infeasible
[2021-10-21 19:28:01,561 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-21 19:28:01,562 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-21 19:28:01,564 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-21 19:28:01,564 INFO  L87              Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand  has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-21 19:28:01,740 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-21 19:28:01,740 INFO  L93              Difference]: Finished difference Result 27 states and 41 transitions.
[2021-10-21 19:28:01,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-21 19:28:01,741 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions.
[2021-10-21 19:28:01,743 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 23
[2021-10-21 19:28:01,745 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions.
[2021-10-21 19:28:01,745 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 27
[2021-10-21 19:28:01,745 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 27
[2021-10-21 19:28:01,745 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions.
[2021-10-21 19:28:01,745 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-21 19:28:01,746 INFO  L681         BuchiCegarLoop]: Abstraction has 27 states and 41 transitions.
[2021-10-21 19:28:01,746 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions.
[2021-10-21 19:28:01,748 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23.
[2021-10-21 19:28:01,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-21 19:28:01,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions.
[2021-10-21 19:28:01,751 INFO  L704         BuchiCegarLoop]: Abstraction has 23 states and 35 transitions.
[2021-10-21 19:28:01,751 INFO  L587         BuchiCegarLoop]: Abstraction has 23 states and 35 transitions.
[2021-10-21 19:28:01,752 INFO  L425         BuchiCegarLoop]: ======== Iteration 3============
[2021-10-21 19:28:01,752 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions.
[2021-10-21 19:28:01,756 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 20
[2021-10-21 19:28:01,756 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-21 19:28:01,756 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-21 19:28:01,757 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-21 19:28:01,757 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-21 19:28:01,758 INFO  L791   eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 119#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 124#L545-2 
[2021-10-21 19:28:01,758 INFO  L793   eck$LassoCheckResult]: Loop: 124#L545-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 120#L535-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 113#L534-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 114#L534-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 135#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 129#L540 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 130#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 123#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 124#L545-2 
[2021-10-21 19:28:01,759 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-21 19:28:01,760 INFO  L82        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times
[2021-10-21 19:28:01,760 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-21 19:28:01,761 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399291515]
[2021-10-21 19:28:01,761 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-21 19:28:01,761 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-21 19:28:01,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:01,777 INFO  L354             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-21 19:28:01,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:01,794 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-21 19:28:01,794 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-21 19:28:01,795 INFO  L82        PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times
[2021-10-21 19:28:01,795 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-21 19:28:01,795 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830934041]
[2021-10-21 19:28:01,795 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-21 19:28:01,796 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-21 19:28:01,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:01,810 INFO  L354             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-21 19:28:01,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:01,832 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-21 19:28:01,832 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-21 19:28:01,832 INFO  L82        PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times
[2021-10-21 19:28:01,833 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-21 19:28:01,833 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371641703]
[2021-10-21 19:28:01,833 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-21 19:28:01,833 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-21 19:28:01,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-21 19:28:01,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-21 19:28:01,965 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-21 19:28:01,965 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371641703]
[2021-10-21 19:28:01,965 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371641703] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-21 19:28:01,965 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-21 19:28:01,966 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-21 19:28:01,966 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488871262]
[2021-10-21 19:28:02,266 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-21 19:28:02,267 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-21 19:28:02,267 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-10-21 19:28:02,268 INFO  L87              Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 Second operand  has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-21 19:28:02,503 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-21 19:28:02,503 INFO  L93              Difference]: Finished difference Result 54 states and 80 transitions.
[2021-10-21 19:28:02,503 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-10-21 19:28:02,503 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions.
[2021-10-21 19:28:02,506 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 44
[2021-10-21 19:28:02,507 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions.
[2021-10-21 19:28:02,507 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 54
[2021-10-21 19:28:02,508 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 54
[2021-10-21 19:28:02,508 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions.
[2021-10-21 19:28:02,508 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-21 19:28:02,508 INFO  L681         BuchiCegarLoop]: Abstraction has 54 states and 80 transitions.
[2021-10-21 19:28:02,509 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions.
[2021-10-21 19:28:02,511 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31.
[2021-10-21 19:28:02,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-21 19:28:02,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions.
[2021-10-21 19:28:02,513 INFO  L704         BuchiCegarLoop]: Abstraction has 31 states and 45 transitions.
[2021-10-21 19:28:02,513 INFO  L587         BuchiCegarLoop]: Abstraction has 31 states and 45 transitions.
[2021-10-21 19:28:02,513 INFO  L425         BuchiCegarLoop]: ======== Iteration 4============
[2021-10-21 19:28:02,513 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions.
[2021-10-21 19:28:02,514 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 28
[2021-10-21 19:28:02,514 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-21 19:28:02,514 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-21 19:28:02,514 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-21 19:28:02,514 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-21 19:28:02,515 INFO  L791   eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 209#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 215#L545-2 
[2021-10-21 19:28:02,515 INFO  L793   eck$LassoCheckResult]: Loop: 215#L545-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 218#L535-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 204#L534-1 assume !main_#t~short9; 205#L534-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 234#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 232#L540 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 227#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 214#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 215#L545-2 
[2021-10-21 19:28:02,515 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-21 19:28:02,515 INFO  L82        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times
[2021-10-21 19:28:02,515 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-21 19:28:02,516 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989439141]
[2021-10-21 19:28:02,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-21 19:28:02,516 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-21 19:28:02,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:02,527 INFO  L354             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-21 19:28:02,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:02,541 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-21 19:28:02,542 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-21 19:28:02,542 INFO  L82        PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times
[2021-10-21 19:28:02,542 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-21 19:28:02,542 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056322812]
[2021-10-21 19:28:02,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-21 19:28:02,543 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-21 19:28:02,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:02,550 INFO  L354             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-21 19:28:02,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:02,560 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-21 19:28:02,561 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-21 19:28:02,561 INFO  L82        PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times
[2021-10-21 19:28:02,561 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-21 19:28:02,562 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413179199]
[2021-10-21 19:28:02,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-21 19:28:02,562 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-21 19:28:02,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:02,578 INFO  L354             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-21 19:28:02,591 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-21 19:28:02,598 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-21 19:28:03,400 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.10 07:28:03 BoogieIcfgContainer
[2021-10-21 19:28:03,416 INFO  L132        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2021-10-21 19:28:03,416 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-21 19:28:03,416 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-10-21 19:28:03,417 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-10-21 19:28:03,417 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:28:00" (3/4) ...
[2021-10-21 19:28:03,420 INFO  L134         WitnessPrinter]: Generating witness for non-termination counterexample
[2021-10-21 19:28:03,473 INFO  L141         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/witness.graphml
[2021-10-21 19:28:03,476 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-21 19:28:03,478 INFO  L168              Benchmark]: Toolchain (without parser) took 3921.94 ms. Allocated memory was 90.2 MB in the beginning and 151.0 MB in the end (delta: 60.8 MB). Free memory was 55.6 MB in the beginning and 94.2 MB in the end (delta: -38.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB.
[2021-10-21 19:28:03,478 INFO  L168              Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 90.2 MB. Free memory is still 49.4 MB. There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-21 19:28:03,479 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 542.19 ms. Allocated memory was 90.2 MB in the beginning and 123.7 MB in the end (delta: 33.6 MB). Free memory was 55.3 MB in the beginning and 92.5 MB in the end (delta: -37.2 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB.
[2021-10-21 19:28:03,479 INFO  L168              Benchmark]: Boogie Procedure Inliner took 86.89 ms. Allocated memory is still 123.7 MB. Free memory was 92.5 MB in the beginning and 90.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-21 19:28:03,479 INFO  L168              Benchmark]: Boogie Preprocessor took 71.60 ms. Allocated memory is still 123.7 MB. Free memory was 90.4 MB in the beginning and 88.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-21 19:28:03,480 INFO  L168              Benchmark]: RCFGBuilder took 601.55 ms. Allocated memory is still 123.7 MB. Free memory was 88.7 MB in the beginning and 70.6 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
[2021-10-21 19:28:03,481 INFO  L168              Benchmark]: BuchiAutomizer took 2553.88 ms. Allocated memory was 123.7 MB in the beginning and 151.0 MB in the end (delta: 27.3 MB). Free memory was 70.2 MB in the beginning and 96.3 MB in the end (delta: -26.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB.
[2021-10-21 19:28:03,481 INFO  L168              Benchmark]: Witness Printer took 60.23 ms. Allocated memory is still 151.0 MB. Free memory was 96.3 MB in the beginning and 94.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-21 19:28:03,484 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.26 ms. Allocated memory is still 90.2 MB. Free memory is still 49.4 MB. There was no memory consumed. Max. memory is 16.1 GB.
 * CACSL2BoogieTranslator took 542.19 ms. Allocated memory was 90.2 MB in the beginning and 123.7 MB in the end (delta: 33.6 MB). Free memory was 55.3 MB in the beginning and 92.5 MB in the end (delta: -37.2 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB.
 * Boogie Procedure Inliner took 86.89 ms. Allocated memory is still 123.7 MB. Free memory was 92.5 MB in the beginning and 90.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * Boogie Preprocessor took 71.60 ms. Allocated memory is still 123.7 MB. Free memory was 90.4 MB in the beginning and 88.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * RCFGBuilder took 601.55 ms. Allocated memory is still 123.7 MB. Free memory was 88.7 MB in the beginning and 70.6 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
 * BuchiAutomizer took 2553.88 ms. Allocated memory was 123.7 MB in the beginning and 151.0 MB in the end (delta: 27.3 MB). Free memory was 70.2 MB in the beginning and 96.3 MB in the end (delta: -26.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB.
 * Witness Printer took 60.23 ms. Allocated memory is still 151.0 MB. Free memory was 96.3 MB in the beginning and 94.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 31 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 2.4s and 4 iterations.  TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 22.4ms AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3.	Nontrivial modules had stage [0, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 80 SDtfs, 50 SDslu, 76 SDs, 0 SdLazy, 156 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 286.6ms Time	LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	
  - TerminationAnalysisResult: Nontermination possible
    Buchi Automizer proved that your program is nonterminating for some inputs
  - FixpointNonTerminationResult [Line: 532]: Nontermination argument in form of an infinite program execution.
    Nontermination argument in form of an infinite execution
State at position 0 is
{NULL=31292}
State at position 1 is
{org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@a2b164b=0, NULL=0, NULL=31293, NULL=31292, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34592e14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@696ac92a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@74faba7b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51fab2a2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@8c15a9a=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3955e4c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63037d0b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@a2b164b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@696ac92a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d4e2cf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3fef1f6e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e24f7=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68c4c31f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63037d0b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@482f8491=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fba9b9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11a7bd39=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fba9b9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51fab2a2=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3955e4c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34592e14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37e6bb0e=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75fc3559=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69b44899=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11a7bd39=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@52628d2f=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75eb3e6c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@74faba7b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@685817f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@493b98ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37e6bb0e=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@493b98ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b64c1e=26, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3fef1f6e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@8c15a9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69b44899=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75eb3e6c=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@7d856d86=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@685817f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@17122397=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@482f8491=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@52628d2f=0, pred=0, NULL=31294, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75fc3559=0}
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 532]: Nonterminating execution
    Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L529]        struct TreeNode* root = malloc(sizeof(*root)), *n;
[L529]        struct TreeNode* root = malloc(sizeof(*root)), *n;
[L530]        root->left = ((void *)0)
[L531]        root->right = ((void *)0)
Loop:
[L532]  COND TRUE   __VERIFIER_nondet_int()
[L533]              n = root
[L534]  EXPR        n->left
[L534]              n->left && n->right
[L534]  COND FALSE  !(n->left && n->right)
[L540]  EXPR        n->left
[L540]  COND FALSE  !(!n->left && __VERIFIER_nondet_int())
[L545]  EXPR        n->right
[L545]  COND FALSE  !(!n->right && __VERIFIER_nondet_int())
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
[2021-10-21 19:28:03,527 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83528f1-b55f-4b11-abc9-292ff197f45a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...