./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/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_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/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 64bit --witnessprinter.graph.data.programhash a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:26:51,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:26:51,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:26:51,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:26:51,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:26:51,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:26:51,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:26:51,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:26:51,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:26:51,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:26:51,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:26:51,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:26:51,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:26:51,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:26:51,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:26:51,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:26:51,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:26:51,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:26:51,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:26:51,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:26:51,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:26:51,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:26:51,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:26:51,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:26:51,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:26:51,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:26:51,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:26:51,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:26:51,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:26:51,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:26:51,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:26:51,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:26:51,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:26:51,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:26:51,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:26:51,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:26:51,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:26:51,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:26:51,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:26:51,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:26:51,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:26:51,571 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-10-21 19:26:51,623 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:26:51,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:26:51,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:26:51,624 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:26:51,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:26:51,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:26:51,626 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:26:51,627 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-21 19:26:51,627 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-21 19:26:51,627 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-21 19:26:51,628 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-21 19:26:51,629 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-21 19:26:51,629 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-21 19:26:51,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:26:51,630 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:26:51,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:26:51,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:26:51,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-21 19:26:51,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-21 19:26:51,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-21 19:26:51,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:26:51,631 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-21 19:26:51,631 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:26:51,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-21 19:26:51,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:26:51,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:26:51,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:26:51,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:26:51,634 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:26:51,636 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-21 19:26:51,636 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_6db5041b-07a0-48d9-b014-6f979eae6810/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_6db5041b-07a0-48d9-b014-6f979eae6810/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 [2021-10-21 19:26:51,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:26:51,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:26:51,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:26:51,962 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:26:51,962 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:26:51,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2021-10-21 19:26:52,041 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/data/a1867157d/fec0b5a62d884a77b5c4d1dfa4507177/FLAGee3751659 [2021-10-21 19:26:52,651 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:26:52,651 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2021-10-21 19:26:52,678 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/data/a1867157d/fec0b5a62d884a77b5c4d1dfa4507177/FLAGee3751659 [2021-10-21 19:26:52,908 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/data/a1867157d/fec0b5a62d884a77b5c4d1dfa4507177 [2021-10-21 19:26:52,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:26:52,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:26:52,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:26:52,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:26:52,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:26:52,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:26:52" (1/1) ... [2021-10-21 19:26:52,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3519ac2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:52, skipping insertion in model container [2021-10-21 19:26:52,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:26:52" (1/1) ... [2021-10-21 19:26:52,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:26:52,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:26:53,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:26:53,383 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:26:53,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:26:53,479 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:26:53,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:53 WrapperNode [2021-10-21 19:26:53,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:26:53,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:26:53,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:26:53,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:26:53,491 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:26:53" (1/1) ... [2021-10-21 19:26:53,525 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:26:53" (1/1) ... [2021-10-21 19:26:53,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:26:53,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:26:53,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:26:53,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:26:53,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:53" (1/1) ... [2021-10-21 19:26:53,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:53" (1/1) ... [2021-10-21 19:26:53,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:53" (1/1) ... [2021-10-21 19:26:53,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:53" (1/1) ... [2021-10-21 19:26:53,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:53" (1/1) ... [2021-10-21 19:26:53,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:53" (1/1) ... [2021-10-21 19:26:53,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:53" (1/1) ... [2021-10-21 19:26:53,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:26:53,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:26:53,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:26:53,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:26:53,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:53" (1/1) ... [2021-10-21 19:26:53,620 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:26:53,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:26:53,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:26:53,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-21 19:26:53,700 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2021-10-21 19:26:53,701 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2021-10-21 19:26:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 19:26:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-21 19:26:53,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-21 19:26:53,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-21 19:26:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure length [2021-10-21 19:26:53,703 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2021-10-21 19:26:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:26:53,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:26:54,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:26:54,029 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-21 19:26:54,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:26:54 BoogieIcfgContainer [2021-10-21 19:26:54,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:26:54,036 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-21 19:26:54,036 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-21 19:26:54,048 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-21 19:26:54,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:26:54,049 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.10 07:26:52" (1/3) ... [2021-10-21 19:26:54,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b003786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:26:54, skipping insertion in model container [2021-10-21 19:26:54,051 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:26:54,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:26:53" (2/3) ... [2021-10-21 19:26:54,052 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b003786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:26:54, skipping insertion in model container [2021-10-21 19:26:54,052 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:26:54,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:26:54" (3/3) ... [2021-10-21 19:26:54,054 INFO L389 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2021-10-21 19:26:54,105 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-21 19:26:54,105 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-21 19:26:54,105 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-21 19:26:54,106 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-21 19:26:54,106 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-21 19:26:54,106 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-21 19:26:54,106 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-21 19:26:54,106 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-21 19:26:54,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-10-21 19:26:54,142 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-10-21 19:26:54,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:26:54,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:26:54,149 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-21 19:26:54,149 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-21 19:26:54,150 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-21 19:26:54,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-10-21 19:26:54,159 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-10-21 19:26:54,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:26:54,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:26:54,163 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-21 19:26:54,163 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-21 19:26:54,172 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 15#L574true assume !(main_~n~0 < 1); 27#L577true call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 14#new_llENTRYtrue [2021-10-21 19:26:54,172 INFO L793 eck$LassoCheckResult]: Loop: 14#new_llENTRYtrue ~n := #in~n; 21#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 16#L552true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 14#new_llENTRYtrue [2021-10-21 19:26:54,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:54,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2021-10-21 19:26:54,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:54,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976609409] [2021-10-21 19:26:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:54,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:54,324 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:26:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:54,372 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:26:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2021-10-21 19:26:54,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:54,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754171320] [2021-10-21 19:26:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:54,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:54,427 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:26:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:54,472 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:26:54,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:54,475 INFO L82 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2021-10-21 19:26:54,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:54,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220683196] [2021-10-21 19:26:54,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:54,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:54,494 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:26:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:54,517 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:26:55,528 INFO L210 LassoAnalysis]: Preferences: [2021-10-21 19:26:55,529 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-21 19:26:55,529 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-21 19:26:55,529 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-21 19:26:55,530 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-21 19:26:55,530 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:26:55,530 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-21 19:26:55,531 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-21 19:26:55,532 INFO L133 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2021-10-21 19:26:55,532 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-21 19:26:55,532 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-21 19:26:55,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:26:55,963 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-21 19:26:55,968 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-21 19:26:55,969 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:26:55,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:26:55,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:26:55,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:26:55,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:26:55,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:26:55,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:26:55,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:26:55,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:26:56,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:26:56,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:26:56,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-10-21 19:26:56,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:26:56,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-10-21 19:26:56,045 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:26:56,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:26:56,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:26:56,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-10-21 19:26:56,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:26:56,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:26:56,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:26:56,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:26:56,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:26:56,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:26:56,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:26:56,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:26:56,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:26:56,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-10-21 19:26:56,105 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:26:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:26:56,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:26:56,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-10-21 19:26:56,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:26:56,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:26:56,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:26:56,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:26:56,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:26:56,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:26:56,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:26:56,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:26:56,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:26:56,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:56,179 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:26:56,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:26:56,180 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:26:56,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-10-21 19:26:56,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:26:56,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:26:56,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:26:56,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:26:56,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:26:56,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:26:56,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:26:56,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:26:56,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:26:56,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:56,215 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:26:56,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:26:56,216 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:26:56,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-10-21 19:26:56,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:26:56,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:26:56,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:26:56,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:26:56,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:26:56,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:26:56,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:26:56,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:26:56,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:26:56,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:56,335 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:26:56,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:26:56,351 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:26:56,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:26:56,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:26:56,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:26:56,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:26:56,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:26:56,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:26:56,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:26:56,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:26:56,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-10-21 19:26:56,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:26:56,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:56,411 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:26:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:26:56,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:26:56,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-10-21 19:26:56,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:26:56,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:26:56,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:26:56,423 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-10-21 19:26:56,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:26:56,437 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-10-21 19:26:56,437 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-10-21 19:26:56,455 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-21 19:26:56,481 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-10-21 19:26:56,482 INFO L444 ModelExtractionUtils]: 3 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-10-21 19:26:56,483 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:26:56,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:26:56,485 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:26:56,490 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-21 19:26:56,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-10-21 19:26:56,540 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2021-10-21 19:26:56,540 INFO L513 LassoAnalysis]: Proved termination. [2021-10-21 19:26:56,540 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_ll_#in~n) = 1*new_ll_#in~n Supporting invariants [1*new_ll_#in~n >= 0] [2021-10-21 19:26:56,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:56,583 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2021-10-21 19:26:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:56,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-21 19:26:56,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:26:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:56,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-21 19:26:56,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:26:56,760 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:26:56,776 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2021-10-21 19:26:56,778 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:26:56,922 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4). Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 54 transitions. Complement of second has 13 states. [2021-10-21 19:26:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-10-21 19:26:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:26:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2021-10-21 19:26:56,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2021-10-21 19:26:56,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:26:56,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2021-10-21 19:26:56,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:26:56,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2021-10-21 19:26:56,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:26:56,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2021-10-21 19:26:56,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-10-21 19:26:56,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2021-10-21 19:26:56,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-10-21 19:26:56,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-10-21 19:26:56,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2021-10-21 19:26:56,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:26:56,949 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-10-21 19:26:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2021-10-21 19:26:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-10-21 19:26:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-10-21 19:26:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-10-21 19:26:56,974 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-10-21 19:26:56,975 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-10-21 19:26:56,975 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-21 19:26:56,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2021-10-21 19:26:56,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-10-21 19:26:56,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:26:56,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:26:56,977 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:26:56,977 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-21 19:26:56,977 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 147#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 154#L574 assume !(main_~n~0 < 1); 143#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 162#new_llENTRY ~n := #in~n; 163#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 165#new_llFINAL assume true; 159#new_llEXIT >#57#return; 157#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 158#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 160#L566-3 [2021-10-21 19:26:56,977 INFO L793 eck$LassoCheckResult]: Loop: 160#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 161#L566-1 assume !!(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8);append_~x.base, append_~x.offset := append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem7.base, append_#t~mem7.offset; 160#L566-3 [2021-10-21 19:26:56,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:56,978 INFO L82 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2021-10-21 19:26:56,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:56,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819205780] [2021-10-21 19:26:56,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:56,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:57,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:26:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:57,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-10-21 19:26:57,130 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:26:57,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:26:57,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819205780] [2021-10-21 19:26:57,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819205780] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:26:57,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:26:57,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:26:57,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637266938] [2021-10-21 19:26:57,134 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:26:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:57,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2021-10-21 19:26:57,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:57,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555851039] [2021-10-21 19:26:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:57,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:57,141 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:26:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:57,146 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:26:57,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:26:57,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:26:57,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:26:57,197 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:26:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:26:57,284 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2021-10-21 19:26:57,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:26:57,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2021-10-21 19:26:57,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-10-21 19:26:57,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2021-10-21 19:26:57,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-10-21 19:26:57,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-10-21 19:26:57,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2021-10-21 19:26:57,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:26:57,300 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-10-21 19:26:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2021-10-21 19:26:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-21 19:26:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-10-21 19:26:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-10-21 19:26:57,307 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-10-21 19:26:57,307 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-10-21 19:26:57,307 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-21 19:26:57,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2021-10-21 19:26:57,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-10-21 19:26:57,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:26:57,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:26:57,310 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:26:57,310 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-21 19:26:57,311 INFO L791 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 218#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 225#L574 assume !(main_~n~0 < 1); 213#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 232#new_llENTRY ~n := #in~n; 224#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 212#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 233#new_llENTRY ~n := #in~n; 222#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 223#new_llFINAL assume true; 226#new_llEXIT >#53#return; 211#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 214#new_llFINAL assume true; 234#new_llEXIT >#57#return; 228#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 229#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 230#L566-3 [2021-10-21 19:26:57,312 INFO L793 eck$LassoCheckResult]: Loop: 230#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 231#L566-1 assume !!(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8);append_~x.base, append_~x.offset := append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem7.base, append_#t~mem7.offset; 230#L566-3 [2021-10-21 19:26:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:57,312 INFO L82 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2021-10-21 19:26:57,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:57,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953203830] [2021-10-21 19:26:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:57,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:57,342 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:26:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:57,367 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:26:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2021-10-21 19:26:57,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:57,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265286076] [2021-10-21 19:26:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:57,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:57,372 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:26:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:57,377 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:26:57,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2021-10-21 19:26:57,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:57,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817772150] [2021-10-21 19:26:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:57,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:57,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:26:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:57,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:26:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-21 19:26:57,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:26:57,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817772150] [2021-10-21 19:26:57,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817772150] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:26:57,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628188938] [2021-10-21 19:26:57,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:57,566 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:26:57,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:26:57,567 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:26:57,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-21 19:26:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:57,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 41 conjunts are in the unsatisfiable core [2021-10-21 19:26:57,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:26:57,688 INFO L388 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 [2021-10-21 19:26:57,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-10-21 19:26:57,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-10-21 19:26:58,028 INFO L388 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 34 treesize of output 26 [2021-10-21 19:26:58,033 INFO L388 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 23 treesize of output 15 [2021-10-21 19:26:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:26:58,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628188938] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:26:58,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:26:58,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2021-10-21 19:26:58,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408764257] [2021-10-21 19:26:58,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:26:58,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:26:58,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:26:58,099 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-10-21 19:26:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:26:58,329 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2021-10-21 19:26:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:26:58,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2021-10-21 19:26:58,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-10-21 19:26:58,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2021-10-21 19:26:58,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-10-21 19:26:58,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-10-21 19:26:58,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2021-10-21 19:26:58,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:26:58,332 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-10-21 19:26:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2021-10-21 19:26:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2021-10-21 19:26:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:26:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2021-10-21 19:26:58,336 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-10-21 19:26:58,336 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-10-21 19:26:58,337 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-21 19:26:58,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2021-10-21 19:26:58,338 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-10-21 19:26:58,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:26:58,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:26:58,340 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:26:58,341 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-21 19:26:58,341 INFO L791 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 368#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 375#L574 assume !(main_~n~0 < 1); 362#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 384#new_llENTRY ~n := #in~n; 374#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 363#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 385#new_llENTRY ~n := #in~n; 372#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 373#new_llFINAL assume true; 380#new_llEXIT >#53#return; 381#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 391#new_llFINAL assume true; 390#new_llEXIT >#57#return; 378#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 379#L563 assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; 365#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 366#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 377#lengthENTRY [2021-10-21 19:26:58,341 INFO L793 eck$LassoCheckResult]: Loop: 377#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 370#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 371#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 377#lengthENTRY [2021-10-21 19:26:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2021-10-21 19:26:58,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:58,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579040443] [2021-10-21 19:26:58,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:58,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:58,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:26:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:58,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:26:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:26:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-21 19:26:58,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:26:58,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579040443] [2021-10-21 19:26:58,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579040443] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:26:58,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:26:58,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:26:58,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655798210] [2021-10-21 19:26:58,479 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:26:58,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2021-10-21 19:26:58,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:58,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737099951] [2021-10-21 19:26:58,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:58,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:58,485 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:26:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:58,491 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:26:58,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:26:58,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:26:58,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:26:58,651 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-21 19:26:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:26:58,717 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-10-21 19:26:58,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:26:58,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2021-10-21 19:26:58,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-10-21 19:26:58,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 41 transitions. [2021-10-21 19:26:58,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-10-21 19:26:58,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-10-21 19:26:58,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2021-10-21 19:26:58,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:26:58,721 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-10-21 19:26:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2021-10-21 19:26:58,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2021-10-21 19:26:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:26:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-10-21 19:26:58,726 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-10-21 19:26:58,726 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-10-21 19:26:58,726 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-21 19:26:58,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2021-10-21 19:26:58,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-10-21 19:26:58,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:26:58,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:26:58,728 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:26:58,728 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-21 19:26:58,728 INFO L791 eck$LassoCheckResult]: Stem: 461#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 462#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 469#L574 assume !(main_~n~0 < 1); 459#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 479#new_llENTRY ~n := #in~n; 468#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 458#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 480#new_llENTRY ~n := #in~n; 466#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 467#new_llFINAL assume true; 475#new_llEXIT >#53#return; 476#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 485#new_llFINAL assume true; 482#new_llEXIT >#57#return; 472#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 473#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 483#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 474#L566-1 assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; 463#L566-4 call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8);append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; 455#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 456#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 470#lengthENTRY [2021-10-21 19:26:58,728 INFO L793 eck$LassoCheckResult]: Loop: 470#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 464#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 465#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 470#lengthENTRY [2021-10-21 19:26:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2021-10-21 19:26:58,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:58,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030314204] [2021-10-21 19:26:58,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:58,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:58,745 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:26:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:58,763 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:26:58,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2021-10-21 19:26:58,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:58,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440638758] [2021-10-21 19:26:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:58,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:58,768 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:26:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:58,771 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:26:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:26:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2021-10-21 19:26:58,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:26:58,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099983714] [2021-10-21 19:26:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:26:58,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:26:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:58,807 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:26:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:26:58,828 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:27:01,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.10 07:27:01 BoogieIcfgContainer [2021-10-21 19:27:01,075 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-21 19:27:01,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:27:01,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:27:01,076 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:27:01,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:26:54" (3/4) ... [2021-10-21 19:27:01,079 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-21 19:27:01,134 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:27:01,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:27:01,136 INFO L168 Benchmark]: Toolchain (without parser) took 8222.27 ms. Allocated memory was 100.7 MB in the beginning and 163.6 MB in the end (delta: 62.9 MB). Free memory was 64.2 MB in the beginning and 85.9 MB in the end (delta: -21.6 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:01,136 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 100.7 MB. Free memory was 71.4 MB in the beginning and 71.4 MB in the end (delta: 29.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:27:01,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.47 ms. Allocated memory is still 100.7 MB. Free memory was 64.2 MB in the beginning and 70.3 MB in the end (delta: -6.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:01,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 100.7 MB. Free memory was 70.3 MB in the beginning and 68.2 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:27:01,138 INFO L168 Benchmark]: Boogie Preprocessor took 58.52 ms. Allocated memory is still 100.7 MB. Free memory was 68.2 MB in the beginning and 67.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:01,139 INFO L168 Benchmark]: RCFGBuilder took 424.22 ms. Allocated memory is still 100.7 MB. Free memory was 67.0 MB in the beginning and 55.6 MB in the end (delta: 11.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:01,155 INFO L168 Benchmark]: BuchiAutomizer took 7039.19 ms. Allocated memory was 100.7 MB in the beginning and 163.6 MB in the end (delta: 62.9 MB). Free memory was 55.6 MB in the beginning and 88.0 MB in the end (delta: -32.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:01,156 INFO L168 Benchmark]: Witness Printer took 59.20 ms. Allocated memory is still 163.6 MB. Free memory was 88.0 MB in the beginning and 85.9 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:27:01,159 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.25 ms. Allocated memory is still 100.7 MB. Free memory was 71.4 MB in the beginning and 71.4 MB in the end (delta: 29.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 566.47 ms. Allocated memory is still 100.7 MB. Free memory was 64.2 MB in the beginning and 70.3 MB in the end (delta: -6.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 100.7 MB. Free memory was 70.3 MB in the beginning and 68.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.52 ms. Allocated memory is still 100.7 MB. Free memory was 68.2 MB in the beginning and 67.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 424.22 ms. Allocated memory is still 100.7 MB. Free memory was 67.0 MB in the beginning and 55.6 MB in the end (delta: 11.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 7039.19 ms. Allocated memory was 100.7 MB in the beginning and 163.6 MB in the end (delta: 62.9 MB). Free memory was 55.6 MB in the beginning and 88.0 MB in the end (delta: -32.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.1 GB. * Witness Printer took 59.20 ms. Allocated memory is still 163.6 MB. Free memory was 88.0 MB in the beginning and 85.9 MB in the end (delta: 2.1 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 16 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 6.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 29.1ms AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 61 SDtfs, 51 SDslu, 217 SDs, 0 SdLazy, 269 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 227.7ms Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital140 mio100 ax100 hnf100 lsp95 ukn28 mio100 lsp39 div100 bol100 ite100 ukn100 eq200 hnf86 smp100 dnf146 smp100 tf100 neg94 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 129ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: 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: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {x=0, x=0, y_length=0, NULL=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c74f46d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@25cad8ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c1c82bd=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c1c82bd=0, s=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3173a0e6=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2bdd661c=0, NULL=0, y=0, y=0, \result=0, x=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72872c35=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@692f9658=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@692f9658=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@25cad8ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b17c7ef=0, x=0, y=0, n=0, NULL=0, y=0, xs=-1, \result=0, \result=0, NULL=0, xs=0, xs=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3173a0e6=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c74f46d=0, x=0, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) [L577] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L577] RET, EXPR new_ll(n) [L577] node_t* x = new_ll(n); [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; [L578] node_t* y = append(x, x); [L579] CALL length(y) Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-21 19:27:01,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-21 19:27:01,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db5041b-07a0-48d9-b014-6f979eae6810/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...