./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8265a1502e23b0364b9cd16198377a0ca498fc346156a58eeb954c0e23f901 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:59:51,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:59:51,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:59:51,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:59:51,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:59:51,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:59:51,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:59:51,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:59:51,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:59:51,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:59:51,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:59:51,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:59:51,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:59:51,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:59:51,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:59:51,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:59:51,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:59:51,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:59:51,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:59:51,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:59:51,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:59:51,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:59:51,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:59:51,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:59:51,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:59:51,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:59:51,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:59:51,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:59:51,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:59:51,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:59:51,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:59:51,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:59:51,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:59:51,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:59:51,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:59:51,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:59:51,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:59:51,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:59:51,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:59:51,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:59:51,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:59:51,207 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-28 23:59:51,236 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:59:51,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:59:51,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:59:51,237 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:59:51,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:59:51,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:59:51,239 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:59:51,239 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-28 23:59:51,239 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-28 23:59:51,239 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-28 23:59:51,240 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-28 23:59:51,240 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-28 23:59:51,240 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-28 23:59:51,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:59:51,241 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:59:51,241 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 23:59:51,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:59:51,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:59:51,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:59:51,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-28 23:59:51,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-28 23:59:51,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-28 23:59:51,242 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:59:51,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:59:51,243 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-28 23:59:51,243 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:59:51,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-28 23:59:51,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:59:51,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:59:51,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:59:51,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:59:51,244 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:59:51,245 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-28 23:59:51,246 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_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/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_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a8265a1502e23b0364b9cd16198377a0ca498fc346156a58eeb954c0e23f901 [2021-10-28 23:59:51,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:59:51,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:59:51,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:59:51,525 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:59:51,526 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:59:51,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2021-10-28 23:59:51,588 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/data/5ae467f69/8bd32fc09881414eae526ea14be194ee/FLAG9eaa6d6e7 [2021-10-28 23:59:52,109 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:59:52,109 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2021-10-28 23:59:52,122 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/data/5ae467f69/8bd32fc09881414eae526ea14be194ee/FLAG9eaa6d6e7 [2021-10-28 23:59:52,405 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/data/5ae467f69/8bd32fc09881414eae526ea14be194ee [2021-10-28 23:59:52,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:59:52,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:59:52,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:59:52,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:59:52,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:59:52,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366afdeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52, skipping insertion in model container [2021-10-28 23:59:52,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:59:52,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:59:52,680 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c[8209,8222] [2021-10-28 23:59:52,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:59:52,690 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:59:52,733 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c[8209,8222] [2021-10-28 23:59:52,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:59:52,748 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:59:52,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52 WrapperNode [2021-10-28 23:59:52,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:59:52,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:59:52,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:59:52,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:59:52,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:59:52,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:59:52,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:59:52,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:59:52,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:59:52,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:59:52,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:59:52,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:59:52,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52" (1/1) ... [2021-10-28 23:59:52,870 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:59:52,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:59:52,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:59:52,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-28 23:59:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:59:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:59:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:59:52,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:59:53,424 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:59:53,424 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-10-28 23:59:53,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:59:53 BoogieIcfgContainer [2021-10-28 23:59:53,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:59:53,428 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-28 23:59:53,428 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-28 23:59:53,435 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-28 23:59:53,436 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:59:53,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 11:59:52" (1/3) ... [2021-10-28 23:59:53,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@290a3af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 11:59:53, skipping insertion in model container [2021-10-28 23:59:53,440 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:59:53,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:59:52" (2/3) ... [2021-10-28 23:59:53,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@290a3af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 11:59:53, skipping insertion in model container [2021-10-28 23:59:53,441 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:59:53,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:59:53" (3/3) ... [2021-10-28 23:59:53,442 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c [2021-10-28 23:59:53,490 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-28 23:59:53,490 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-28 23:59:53,490 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-28 23:59:53,491 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-28 23:59:53,491 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-28 23:59:53,491 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-28 23:59:53,491 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-28 23:59:53,491 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-28 23:59:53,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:59:53,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-10-28 23:59:53,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:59:53,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:59:53,541 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:59:53,541 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:59:53,541 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-28 23:59:53,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:59:53,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-10-28 23:59:53,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:59:53,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:59:53,550 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:59:53,550 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:59:53,558 INFO L791 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 43#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 17#L161true assume !(0 == ~r1~0);init_~tmp~0 := 0; 10#L161-1true init_#res := init_~tmp~0; 58#L254true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 12#L310true assume !(0 == main_~i2~0); 5#L310-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 18#L320-2true [2021-10-28 23:59:53,559 INFO L793 eck$LassoCheckResult]: Loop: 18#L320-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 7#L61true assume !(0 != ~mode1~0 % 256); 74#L75true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 52#L75-2true ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 50#L61-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 62#L87true assume !(0 != ~mode2~0 % 256); 65#L100true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 38#L100-2true ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 9#L87-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 57#L112true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 67#L115true assume !(node3_~m3~0 != ~nomsg~0); 73#L115-1true ~mode3~0 := 0; 68#L112-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 75#L137true assume !(0 != ~mode4~0 % 256); 34#L150true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 23#L150-2true ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 51#L137-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 69#L262true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 29#L262-1true check_#res := check_~tmp~1; 6#L282true main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 49#L347true assume !(0 == assert_~arg % 256); 40#L342true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 18#L320-2true [2021-10-28 23:59:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:59:53,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2021-10-28 23:59:53,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:59:53,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597639399] [2021-10-28 23:59:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:59:53,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:59:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:59:53,773 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-28 23:59:53,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:59:53,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597639399] [2021-10-28 23:59:53,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597639399] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:59:53,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:59:53,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:59:53,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472013793] [2021-10-28 23:59:53,782 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 23:59:53,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:59:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1135428887, now seen corresponding path program 1 times [2021-10-28 23:59:53,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:59:53,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21969532] [2021-10-28 23:59:53,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:59:53,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:59:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:59:53,942 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-28 23:59:53,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:59:53,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21969532] [2021-10-28 23:59:53,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21969532] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:59:53,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:59:53,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:59:53,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128317194] [2021-10-28 23:59:53,945 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:59:53,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:59:53,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:59:53,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:59:53,968 INFO L87 Difference]: Start difference. First operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:59:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:59:54,112 INFO L93 Difference]: Finished difference Result 122 states and 194 transitions. [2021-10-28 23:59:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:59:54,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 194 transitions. [2021-10-28 23:59:54,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-28 23:59:54,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 113 states and 163 transitions. [2021-10-28 23:59:54,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2021-10-28 23:59:54,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2021-10-28 23:59:54,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 163 transitions. [2021-10-28 23:59:54,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:59:54,142 INFO L681 BuchiCegarLoop]: Abstraction has 113 states and 163 transitions. [2021-10-28 23:59:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 163 transitions. [2021-10-28 23:59:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2021-10-28 23:59:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.352112676056338) internal successors, (96), 70 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:59:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2021-10-28 23:59:54,209 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2021-10-28 23:59:54,209 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2021-10-28 23:59:54,209 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-28 23:59:54,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 96 transitions. [2021-10-28 23:59:54,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-28 23:59:54,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:59:54,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:59:54,217 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:59:54,217 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:59:54,218 INFO L791 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 268#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 243#L161 assume 0 == ~r1~0; 244#L162 assume ~id1~0 >= 0; 264#L163 assume 0 == ~st1~0; 247#L164 assume ~send1~0 == ~id1~0; 238#L165 assume 0 == ~mode1~0 % 256; 239#L166 assume ~id2~0 >= 0; 251#L167 assume 0 == ~st2~0; 229#L168 assume ~send2~0 == ~id2~0; 230#L169 assume 0 == ~mode2~0 % 256; 286#L170 assume ~id3~0 >= 0; 271#L171 assume 0 == ~st3~0; 269#L172 assume ~send3~0 == ~id3~0; 270#L173 assume 0 == ~mode3~0 % 256; 282#L174 assume ~id4~0 >= 0; 222#L175 assume 0 == ~st4~0; 223#L176 assume ~send4~0 == ~id4~0; 272#L177 assume 0 == ~mode4~0 % 256; 261#L178 assume ~id1~0 != ~id2~0; 262#L179 assume ~id1~0 != ~id3~0; 216#L180 assume ~id1~0 != ~id4~0; 217#L181 assume ~id2~0 != ~id3~0; 256#L182 assume ~id2~0 != ~id4~0; 257#L183 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 231#L161-1 init_#res := init_~tmp~0; 232#L254 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 233#L310 assume !(0 == main_~i2~0); 218#L310-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 219#L320-2 [2021-10-28 23:59:54,218 INFO L793 eck$LassoCheckResult]: Loop: 219#L320-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 224#L61 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 225#L65 assume !(node1_~m1~0 != ~nomsg~0); 246#L65-1 ~mode1~0 := 0; 274#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 275#L87 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 280#L90 assume !(node2_~m2~0 != ~nomsg~0); 252#L90-1 ~mode2~0 := 0; 227#L87-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 228#L112 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 279#L115 assume !(node3_~m3~0 != ~nomsg~0); 259#L115-1 ~mode3~0 := 0; 237#L112-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 284#L137 assume !(0 != ~mode4~0 % 256); 263#L150 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 249#L150-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 250#L137-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 276#L262 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 241#L262-1 check_#res := check_~tmp~1; 220#L282 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 221#L347 assume !(0 == assert_~arg % 256); 266#L342 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 219#L320-2 [2021-10-28 23:59:54,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:59:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2021-10-28 23:59:54,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:59:54,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047516890] [2021-10-28 23:59:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:59:54,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:59:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:59:54,268 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:59:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:59:54,343 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:59:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:59:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash 374777131, now seen corresponding path program 1 times [2021-10-28 23:59:54,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:59:54,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236442413] [2021-10-28 23:59:54,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:59:54,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:59:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:59:54,479 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-28 23:59:54,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:59:54,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236442413] [2021-10-28 23:59:54,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236442413] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:59:54,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:59:54,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:59:54,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242043287] [2021-10-28 23:59:54,481 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:59:54,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:59:54,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:59:54,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:59:54,483 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:59:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:59:54,533 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2021-10-28 23:59:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:59:54,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2021-10-28 23:59:54,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-28 23:59:54,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 93 transitions. [2021-10-28 23:59:54,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-10-28 23:59:54,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-10-28 23:59:54,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2021-10-28 23:59:54,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:59:54,538 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-28 23:59:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2021-10-28 23:59:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-10-28 23:59:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:59:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2021-10-28 23:59:54,549 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-28 23:59:54,549 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-28 23:59:54,549 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-28 23:59:54,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2021-10-28 23:59:54,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-28 23:59:54,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:59:54,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:59:54,555 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:59:54,556 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:59:54,556 INFO L791 eck$LassoCheckResult]: Stem: 435#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 425#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 399#L161 assume 0 == ~r1~0; 400#L162 assume ~id1~0 >= 0; 421#L163 assume 0 == ~st1~0; 403#L164 assume ~send1~0 == ~id1~0; 395#L165 assume 0 == ~mode1~0 % 256; 396#L166 assume ~id2~0 >= 0; 407#L167 assume 0 == ~st2~0; 386#L168 assume ~send2~0 == ~id2~0; 387#L169 assume 0 == ~mode2~0 % 256; 443#L170 assume ~id3~0 >= 0; 428#L171 assume 0 == ~st3~0; 426#L172 assume ~send3~0 == ~id3~0; 427#L173 assume 0 == ~mode3~0 % 256; 439#L174 assume ~id4~0 >= 0; 379#L175 assume 0 == ~st4~0; 380#L176 assume ~send4~0 == ~id4~0; 429#L177 assume 0 == ~mode4~0 % 256; 418#L178 assume ~id1~0 != ~id2~0; 419#L179 assume ~id1~0 != ~id3~0; 373#L180 assume ~id1~0 != ~id4~0; 374#L181 assume ~id2~0 != ~id3~0; 413#L182 assume ~id2~0 != ~id4~0; 414#L183 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 388#L161-1 init_#res := init_~tmp~0; 389#L254 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 390#L310 assume !(0 == main_~i2~0); 375#L310-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 376#L320-2 [2021-10-28 23:59:54,558 INFO L793 eck$LassoCheckResult]: Loop: 376#L320-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 381#L61 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 382#L65 assume !(node1_~m1~0 != ~nomsg~0); 402#L65-1 ~mode1~0 := 0; 431#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 432#L87 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 437#L90 assume !(node2_~m2~0 != ~nomsg~0); 408#L90-1 ~mode2~0 := 0; 384#L87-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 385#L112 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 436#L115 assume !(node3_~m3~0 != ~nomsg~0); 416#L115-1 ~mode3~0 := 0; 394#L112-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 441#L137 assume !(0 != ~mode4~0 % 256); 420#L150 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 405#L150-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 406#L137-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 433#L262 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 442#L263 assume ~r1~0 >= 4; 398#L267 assume ~r1~0 < 4;check_~tmp~1 := 1; 411#L262-1 check_#res := check_~tmp~1; 377#L282 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 378#L347 assume !(0 == assert_~arg % 256); 423#L342 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 376#L320-2 [2021-10-28 23:59:54,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:59:54,560 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2021-10-28 23:59:54,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:59:54,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694320203] [2021-10-28 23:59:54,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:59:54,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:59:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:59:54,603 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:59:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:59:54,653 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:59:54,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:59:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2032251205, now seen corresponding path program 1 times [2021-10-28 23:59:54,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:59:54,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449122032] [2021-10-28 23:59:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:59:54,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:59:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:59:54,716 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-28 23:59:54,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:59:54,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449122032] [2021-10-28 23:59:54,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449122032] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:59:54,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:59:54,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:59:54,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078515797] [2021-10-28 23:59:54,719 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:59:54,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:59:54,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:59:54,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:59:54,721 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:59:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:59:54,758 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2021-10-28 23:59:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:59:54,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2021-10-28 23:59:54,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-10-28 23:59:54,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2021-10-28 23:59:54,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2021-10-28 23:59:54,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2021-10-28 23:59:54,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2021-10-28 23:59:54,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:59:54,772 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-10-28 23:59:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2021-10-28 23:59:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-10-28 23:59:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 106 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:59:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2021-10-28 23:59:54,779 INFO L704 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-10-28 23:59:54,780 INFO L587 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-10-28 23:59:54,780 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-28 23:59:54,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2021-10-28 23:59:54,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-10-28 23:59:54,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:59:54,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:59:54,783 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:59:54,783 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:59:54,783 INFO L791 eck$LassoCheckResult]: Stem: 621#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 611#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 583#L161 assume 0 == ~r1~0; 584#L162 assume ~id1~0 >= 0; 607#L163 assume 0 == ~st1~0; 587#L164 assume ~send1~0 == ~id1~0; 581#L165 assume 0 == ~mode1~0 % 256; 582#L166 assume ~id2~0 >= 0; 591#L167 assume 0 == ~st2~0; 570#L168 assume ~send2~0 == ~id2~0; 571#L169 assume 0 == ~mode2~0 % 256; 631#L170 assume ~id3~0 >= 0; 614#L171 assume 0 == ~st3~0; 612#L172 assume ~send3~0 == ~id3~0; 613#L173 assume 0 == ~mode3~0 % 256; 626#L174 assume ~id4~0 >= 0; 566#L175 assume 0 == ~st4~0; 567#L176 assume ~send4~0 == ~id4~0; 615#L177 assume 0 == ~mode4~0 % 256; 603#L178 assume ~id1~0 != ~id2~0; 604#L179 assume ~id1~0 != ~id3~0; 557#L180 assume ~id1~0 != ~id4~0; 558#L181 assume ~id2~0 != ~id3~0; 598#L182 assume ~id2~0 != ~id4~0; 602#L183 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 572#L161-1 init_#res := init_~tmp~0; 573#L254 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 574#L310 assume !(0 == main_~i2~0); 559#L310-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 560#L320-2 [2021-10-28 23:59:54,784 INFO L793 eck$LassoCheckResult]: Loop: 560#L320-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 563#L61 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 564#L65 assume !(node1_~m1~0 != ~nomsg~0); 586#L65-1 ~mode1~0 := 0; 617#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 618#L87 assume !(0 != ~mode2~0 % 256); 624#L100 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 608#L100-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 568#L87-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 569#L112 assume !(0 != ~mode3~0 % 256); 588#L125 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 577#L125-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 578#L112-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 642#L137 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 640#L140 assume !(node4_~m4~0 != ~nomsg~0); 637#L140-1 ~mode4~0 := 0; 635#L137-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 634#L262 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 633#L263 assume !(~r1~0 >= 4); 579#L266 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 580#L267 assume ~r1~0 < 4;check_~tmp~1 := 1; 597#L262-1 check_#res := check_~tmp~1; 561#L282 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 562#L347 assume !(0 == assert_~arg % 256); 609#L342 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 560#L320-2 [2021-10-28 23:59:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:59:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2021-10-28 23:59:54,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:59:54,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771974559] [2021-10-28 23:59:54,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:59:54,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:59:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:59:54,803 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:59:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:59:54,832 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:59:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:59:54,833 INFO L85 PathProgramCache]: Analyzing trace with hash 452535279, now seen corresponding path program 1 times [2021-10-28 23:59:54,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:59:54,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753686636] [2021-10-28 23:59:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:59:54,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:59:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:59:54,846 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:59:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:59:54,865 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:59:54,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:59:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash -505574839, now seen corresponding path program 1 times [2021-10-28 23:59:54,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:59:54,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385947380] [2021-10-28 23:59:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:59:54,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:59:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:59:54,922 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-28 23:59:54,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:59:54,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385947380] [2021-10-28 23:59:54,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385947380] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:59:54,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:59:54,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:59:54,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403785797] [2021-10-28 23:59:56,007 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 23:59:56,008 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 23:59:56,008 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 23:59:56,008 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 23:59:56,009 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-10-28 23:59:56,009 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:59:56,009 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 23:59:56,010 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 23:59:56,016 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2021-10-28 23:59:56,016 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 23:59:56,016 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 23:59:56,045 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-28 23:59:56,054 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-28 23:59:56,056 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-28 23:59:56,061 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-28 23:59:56,066 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-28 23:59:56,069 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-28 23:59:56,071 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-28 23:59:56,078 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-28 23:59:56,081 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-28 23:59:56,095 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-28 23:59:56,102 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-28 23:59:56,107 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-28 23:59:56,110 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-28 23:59:56,114 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-28 23:59:56,116 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-28 23:59:56,277 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-28 23:59:56,640 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-10-29 00:00:00,893 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-29 00:00:00,894 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-10-29 00:00:00,896 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:00:00,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:00:00,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-29 00:00:00,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-10-29 00:00:00,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-29 00:00:00,910 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-29 00:00:00,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-10-29 00:00:00,949 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:00:00,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:00:00,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-29 00:00:00,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-10-29 00:00:00,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-10-29 00:00:00,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-29 00:00:00,989 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-10-29 00:00:00,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-10-29 00:00:00,992 INFO L210 LassoAnalysis]: Preferences: [2021-10-29 00:00:00,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-29 00:00:00,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-29 00:00:00,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-29 00:00:00,992 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-29 00:00:00,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:00:00,992 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-29 00:00:00,992 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-29 00:00:00,993 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2021-10-29 00:00:00,993 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-29 00:00:00,993 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-29 00:00:00,996 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-29 00:00:01,008 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-29 00:00:01,013 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-29 00:00:01,017 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-29 00:00:01,020 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-29 00:00:01,022 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-29 00:00:01,025 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-29 00:00:01,035 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-29 00:00:01,037 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-29 00:00:01,042 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-29 00:00:01,047 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-29 00:00:01,050 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-29 00:00:01,056 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-29 00:00:01,062 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-29 00:00:01,191 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-29 00:00:01,197 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-29 00:00:01,501 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-10-29 00:00:05,344 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-29 00:00:05,348 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-29 00:00:05,350 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:00:05,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:00:05,351 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-29 00:00:05,359 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-29 00:00:05,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-29 00:00:05,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-29 00:00:05,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-29 00:00:05,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-29 00:00:05,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-29 00:00:05,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-29 00:00:05,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-29 00:00:05,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-10-29 00:00:05,388 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-29 00:00:05,403 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-29 00:00:05,403 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-10-29 00:00:05,405 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:00:05,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:00:05,407 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-29 00:00:05,408 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-29 00:00:05,408 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-29 00:00:05,409 INFO L513 LassoAnalysis]: Proved termination. [2021-10-29 00:00:05,409 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2021-10-29 00:00:05,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-10-29 00:00:05,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-10-29 00:00:05,477 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-10-29 00:00:05,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:00:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:00:05,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-29 00:00:05,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 00:00:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:00:05,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-29 00:00:05,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 00:00:05,856 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-29 00:00:05,860 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-10-29 00:00:05,861 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:00:05,901 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 184 states and 263 transitions. Complement of second has 4 states. [2021-10-29 00:00:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-10-29 00:00:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:00:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2021-10-29 00:00:05,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 25 letters. [2021-10-29 00:00:05,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-29 00:00:05,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 54 letters. Loop has 25 letters. [2021-10-29 00:00:05,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-29 00:00:05,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 50 letters. [2021-10-29 00:00:05,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-29 00:00:05,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 263 transitions. [2021-10-29 00:00:05,910 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-29 00:00:05,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 0 states and 0 transitions. [2021-10-29 00:00:05,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-29 00:00:05,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-29 00:00:05,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-29 00:00:05,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:00:05,911 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:00:05,911 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:00:05,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:00:05,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:00:05,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:00:05,912 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:00:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:00:05,913 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-10-29 00:00:05,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-29 00:00:05,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-10-29 00:00:05,913 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-29 00:00:05,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 00:00:05,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-29 00:00:05,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-29 00:00:05,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-29 00:00:05,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:00:05,914 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:00:05,914 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:00:05,914 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:00:05,914 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-29 00:00:05,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-10-29 00:00:05,915 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-29 00:00:05,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-10-29 00:00:05,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.10 12:00:05 BoogieIcfgContainer [2021-10-29 00:00:05,921 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-29 00:00:05,921 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 00:00:05,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 00:00:05,922 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 00:00:05,922 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:59:53" (3/4) ... [2021-10-29 00:00:05,925 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-29 00:00:05,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 00:00:05,927 INFO L168 Benchmark]: Toolchain (without parser) took 13516.11 ms. Allocated memory was 94.4 MB in the beginning and 163.6 MB in the end (delta: 69.2 MB). Free memory was 70.6 MB in the beginning and 89.6 MB in the end (delta: -19.0 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.1 GB. [2021-10-29 00:00:05,927 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 77.6 MB. Free memory was 53.7 MB in the beginning and 53.7 MB in the end (delta: 35.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 00:00:05,928 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.66 ms. Allocated memory is still 94.4 MB. Free memory was 70.4 MB in the beginning and 65.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 00:00:05,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.26 ms. Allocated memory is still 94.4 MB. Free memory was 65.2 MB in the beginning and 62.9 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 00:00:05,929 INFO L168 Benchmark]: Boogie Preprocessor took 33.94 ms. Allocated memory is still 94.4 MB. Free memory was 62.9 MB in the beginning and 61.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 00:00:05,930 INFO L168 Benchmark]: RCFGBuilder took 569.49 ms. Allocated memory is still 94.4 MB. Free memory was 61.2 MB in the beginning and 70.5 MB in the end (delta: -9.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. [2021-10-29 00:00:05,930 INFO L168 Benchmark]: BuchiAutomizer took 12493.17 ms. Allocated memory was 94.4 MB in the beginning and 163.6 MB in the end (delta: 69.2 MB). Free memory was 70.1 MB in the beginning and 90.6 MB in the end (delta: -20.5 MB). Peak memory consumption was 47.8 MB. Max. memory is 16.1 GB. [2021-10-29 00:00:05,931 INFO L168 Benchmark]: Witness Printer took 4.00 ms. Allocated memory is still 163.6 MB. Free memory was 90.6 MB in the beginning and 89.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 00:00:05,934 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.27 ms. Allocated memory is still 77.6 MB. Free memory was 53.7 MB in the beginning and 53.7 MB in the end (delta: 35.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 338.66 ms. Allocated memory is still 94.4 MB. Free memory was 70.4 MB in the beginning and 65.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.26 ms. Allocated memory is still 94.4 MB. Free memory was 65.2 MB in the beginning and 62.9 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.94 ms. Allocated memory is still 94.4 MB. Free memory was 62.9 MB in the beginning and 61.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 569.49 ms. Allocated memory is still 94.4 MB. Free memory was 61.2 MB in the beginning and 70.5 MB in the end (delta: -9.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 12493.17 ms. Allocated memory was 94.4 MB in the beginning and 163.6 MB in the end (delta: 69.2 MB). Free memory was 70.1 MB in the beginning and 90.6 MB in the end (delta: -20.5 MB). Peak memory consumption was 47.8 MB. Max. memory is 16.1 GB. * Witness Printer took 4.00 ms. Allocated memory is still 163.6 MB. Free memory was 90.6 MB in the beginning and 89.6 MB in the end (delta: 1.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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 + -2 * i2 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 11.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 42 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 107 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 443 SDtfs, 278 SDslu, 752 SDs, 0 SdLazy, 46 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital194 mio100 ax100 hnf100 lsp76 ukn67 mio100 lsp100 div162 bol100 ite100 ukn100 eq171 hnf69 smp100 dnf5114 smp24 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 59ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-10-29 00:00:05,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-10-29 00:00:06,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bd89278-c5e8-4315-8a04-2d32328280ab/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...