./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15-2.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_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/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_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/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_8233cfe8-ab51-4c87-abc0-f504048b258c/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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 22:46:44,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 22:46:44,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 22:46:44,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 22:46:44,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 22:46:44,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 22:46:44,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 22:46:44,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 22:46:44,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 22:46:44,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 22:46:44,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 22:46:44,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 22:46:44,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 22:46:44,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 22:46:44,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 22:46:44,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 22:46:44,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 22:46:44,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 22:46:44,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 22:46:44,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 22:46:44,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 22:46:44,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 22:46:44,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 22:46:44,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 22:46:44,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 22:46:44,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 22:46:44,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 22:46:44,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 22:46:44,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 22:46:44,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 22:46:44,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 22:46:44,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 22:46:44,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 22:46:44,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 22:46:44,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 22:46:44,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 22:46:44,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 22:46:44,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 22:46:44,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 22:46:44,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 22:46:44,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 22:46:44,848 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-28 22:46:44,898 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 22:46:44,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 22:46:44,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 22:46:44,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 22:46:44,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 22:46:44,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 22:46:44,901 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 22:46:44,901 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-28 22:46:44,902 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-28 22:46:44,902 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-28 22:46:44,903 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-28 22:46:44,903 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-28 22:46:44,904 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-28 22:46:44,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 22:46:44,904 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 22:46:44,904 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 22:46:44,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 22:46:44,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 22:46:44,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 22:46:44,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-28 22:46:44,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-28 22:46:44,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-28 22:46:44,906 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 22:46:44,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 22:46:44,906 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-28 22:46:44,907 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 22:46:44,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-28 22:46:44,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 22:46:44,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 22:46:44,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 22:46:44,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 22:46:44,910 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 22:46:44,912 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-28 22:46:44,912 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_8233cfe8-ab51-4c87-abc0-f504048b258c/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_8233cfe8-ab51-4c87-abc0-f504048b258c/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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2021-10-28 22:46:45,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 22:46:45,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 22:46:45,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 22:46:45,273 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 22:46:45,275 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 22:46:45,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/locks/test_locks_15-2.c [2021-10-28 22:46:45,378 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/data/9d51dfc10/a6c57a1ec93a42499c70b98a4252ef78/FLAG514922cd8 [2021-10-28 22:46:45,868 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 22:46:45,872 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/sv-benchmarks/c/locks/test_locks_15-2.c [2021-10-28 22:46:45,888 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/data/9d51dfc10/a6c57a1ec93a42499c70b98a4252ef78/FLAG514922cd8 [2021-10-28 22:46:46,212 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/data/9d51dfc10/a6c57a1ec93a42499c70b98a4252ef78 [2021-10-28 22:46:46,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 22:46:46,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 22:46:46,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 22:46:46,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 22:46:46,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 22:46:46,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47566120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46, skipping insertion in model container [2021-10-28 22:46:46,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 22:46:46,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 22:46:46,430 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_8233cfe8-ab51-4c87-abc0-f504048b258c/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2021-10-28 22:46:46,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:46:46,442 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 22:46:46,472 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_8233cfe8-ab51-4c87-abc0-f504048b258c/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2021-10-28 22:46:46,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:46:46,496 INFO L208 MainTranslator]: Completed translation [2021-10-28 22:46:46,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46 WrapperNode [2021-10-28 22:46:46,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 22:46:46,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 22:46:46,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 22:46:46,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 22:46:46,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 22:46:46,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 22:46:46,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 22:46:46,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 22:46:46,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 22:46:46,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 22:46:46,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 22:46:46,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 22:46:46,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46" (1/1) ... [2021-10-28 22:46:46,590 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 22:46:46,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:46:46,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 22:46:46,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-28 22:46:46,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 22:46:46,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 22:46:46,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 22:46:46,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 22:46:47,123 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 22:46:47,124 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-28 22:46:47,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:46:47 BoogieIcfgContainer [2021-10-28 22:46:47,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 22:46:47,128 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-28 22:46:47,129 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-28 22:46:47,147 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-28 22:46:47,148 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 22:46:47,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 10:46:46" (1/3) ... [2021-10-28 22:46:47,155 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5de0610c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 10:46:47, skipping insertion in model container [2021-10-28 22:46:47,155 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 22:46:47,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:46:46" (2/3) ... [2021-10-28 22:46:47,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5de0610c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 10:46:47, skipping insertion in model container [2021-10-28 22:46:47,156 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 22:46:47,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:46:47" (3/3) ... [2021-10-28 22:46:47,158 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2021-10-28 22:46:47,241 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-28 22:46:47,241 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-28 22:46:47,241 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-28 22:46:47,242 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-28 22:46:47,242 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-28 22:46:47,242 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-28 22:46:47,242 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-28 22:46:47,242 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-28 22:46:47,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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 22:46:47,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-10-28 22:46:47,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:47,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:47,336 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:47,336 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:47,336 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-28 22:46:47,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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 22:46:47,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-10-28 22:46:47,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:47,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:47,345 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:47,345 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:47,353 INFO L791 eck$LassoCheckResult]: Stem: 44#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 34#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 21#L225-1true [2021-10-28 22:46:47,355 INFO L793 eck$LassoCheckResult]: Loop: 21#L225-1true assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 33#L58true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 29#L93true assume 0 != main_~p1~0;main_~lk1~0 := 1; 26#L93-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 14#L97-1true assume !(0 != main_~p3~0); 17#L101-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 51#L105-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 46#L109-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L113-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 23#L117-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 31#L121-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 18#L125-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 36#L129-1true assume !(0 != main_~p11~0); 4#L133-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 7#L137-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 41#L141-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 55#L145-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 49#L149-1true assume !(0 != main_~p1~0); 48#L155-1true assume !(0 != main_~p2~0); 28#L160-1true assume !(0 != main_~p3~0); 12#L165-1true assume !(0 != main_~p4~0); 43#L170-1true assume !(0 != main_~p5~0); 47#L175-1true assume !(0 != main_~p6~0); 19#L180-1true assume !(0 != main_~p7~0); 40#L185-1true assume !(0 != main_~p8~0); 25#L190-1true assume !(0 != main_~p9~0); 42#L195-1true assume !(0 != main_~p10~0); 16#L200-1true assume !(0 != main_~p11~0); 45#L205-1true assume !(0 != main_~p12~0); 24#L210-1true assume !(0 != main_~p13~0); 6#L215-1true assume !(0 != main_~p14~0); 38#L220-1true assume !(0 != main_~p15~0); 21#L225-1true [2021-10-28 22:46:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:47,363 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-28 22:46:47,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:47,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82234475] [2021-10-28 22:46:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:47,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:47,544 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:47,608 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:47,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2064553094, now seen corresponding path program 1 times [2021-10-28 22:46:47,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:47,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366829269] [2021-10-28 22:46:47,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:47,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:47,749 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 22:46:47,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:47,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366829269] [2021-10-28 22:46:47,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366829269] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:47,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:47,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:47,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355407321] [2021-10-28 22:46:47,758 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:47,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:47,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:47,778 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:47,821 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2021-10-28 22:46:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:47,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2021-10-28 22:46:47,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-10-28 22:46:47,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 153 transitions. [2021-10-28 22:46:47,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2021-10-28 22:46:47,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2021-10-28 22:46:47,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 153 transitions. [2021-10-28 22:46:47,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:46:47,844 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-10-28 22:46:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 153 transitions. [2021-10-28 22:46:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-10-28 22:46:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 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 22:46:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2021-10-28 22:46:47,904 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-10-28 22:46:47,904 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-10-28 22:46:47,905 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-28 22:46:47,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 153 transitions. [2021-10-28 22:46:47,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-10-28 22:46:47,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:47,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:47,910 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:47,910 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:47,910 INFO L791 eck$LassoCheckResult]: Stem: 215#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 208#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 209#L225-1 [2021-10-28 22:46:47,911 INFO L793 eck$LassoCheckResult]: Loop: 209#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 237#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 236#L93 assume !(0 != main_~p1~0); 235#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 234#L97-1 assume !(0 != main_~p3~0); 233#L101-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 220#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 216#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 183#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 184#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 199#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 191#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 192#L129-1 assume !(0 != main_~p11~0); 168#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 169#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 173#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 212#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 221#L149-1 assume !(0 != main_~p1~0); 222#L155-1 assume !(0 != main_~p2~0); 261#L160-1 assume !(0 != main_~p3~0); 259#L165-1 assume !(0 != main_~p4~0); 256#L170-1 assume !(0 != main_~p5~0); 255#L175-1 assume !(0 != main_~p6~0); 253#L180-1 assume !(0 != main_~p7~0); 250#L185-1 assume !(0 != main_~p8~0); 249#L190-1 assume !(0 != main_~p9~0); 247#L195-1 assume !(0 != main_~p10~0); 187#L200-1 assume !(0 != main_~p11~0); 188#L205-1 assume !(0 != main_~p12~0); 206#L210-1 assume !(0 != main_~p13~0); 241#L215-1 assume !(0 != main_~p14~0); 239#L220-1 assume !(0 != main_~p15~0); 209#L225-1 [2021-10-28 22:46:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-28 22:46:47,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:47,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853592727] [2021-10-28 22:46:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:47,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:47,931 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:47,953 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:47,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:47,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2087185348, now seen corresponding path program 1 times [2021-10-28 22:46:47,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:47,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665234035] [2021-10-28 22:46:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:47,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:48,002 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 22:46:48,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:48,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665234035] [2021-10-28 22:46:48,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665234035] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:48,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:48,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:48,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041834905] [2021-10-28 22:46:48,004 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:48,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:48,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:48,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:48,006 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:48,033 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2021-10-28 22:46:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:48,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 298 transitions. [2021-10-28 22:46:48,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-10-28 22:46:48,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 298 transitions. [2021-10-28 22:46:48,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2021-10-28 22:46:48,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2021-10-28 22:46:48,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 298 transitions. [2021-10-28 22:46:48,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:46:48,055 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-10-28 22:46:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 298 transitions. [2021-10-28 22:46:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-10-28 22:46:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 185 states have internal predecessors, (298), 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 22:46:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2021-10-28 22:46:48,093 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-10-28 22:46:48,093 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-10-28 22:46:48,093 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-28 22:46:48,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 298 transitions. [2021-10-28 22:46:48,097 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-10-28 22:46:48,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:48,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:48,098 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:48,098 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:48,099 INFO L791 eck$LassoCheckResult]: Stem: 508#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 498#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 499#L225-1 [2021-10-28 22:46:48,099 INFO L793 eck$LassoCheckResult]: Loop: 499#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 554#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 552#L93 assume !(0 != main_~p1~0); 537#L93-2 assume !(0 != main_~p2~0); 538#L97-1 assume !(0 != main_~p3~0); 533#L101-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 514#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 509#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 470#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 471#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 486#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 478#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 479#L129-1 assume !(0 != main_~p11~0); 455#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 456#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 460#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 515#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 516#L149-1 assume !(0 != main_~p1~0); 540#L155-1 assume !(0 != main_~p2~0); 591#L160-1 assume !(0 != main_~p3~0); 589#L165-1 assume !(0 != main_~p4~0); 586#L170-1 assume !(0 != main_~p5~0); 585#L175-1 assume !(0 != main_~p6~0); 583#L180-1 assume !(0 != main_~p7~0); 580#L185-1 assume !(0 != main_~p8~0); 579#L190-1 assume !(0 != main_~p9~0); 577#L195-1 assume !(0 != main_~p10~0); 575#L200-1 assume !(0 != main_~p11~0); 573#L205-1 assume !(0 != main_~p12~0); 571#L210-1 assume !(0 != main_~p13~0); 569#L215-1 assume !(0 != main_~p14~0); 558#L220-1 assume !(0 != main_~p15~0); 499#L225-1 [2021-10-28 22:46:48,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:48,100 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-28 22:46:48,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:48,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113263693] [2021-10-28 22:46:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:48,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:48,115 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:48,132 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash -821578554, now seen corresponding path program 1 times [2021-10-28 22:46:48,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:48,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893713955] [2021-10-28 22:46:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:48,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:48,240 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 22:46:48,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:48,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893713955] [2021-10-28 22:46:48,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893713955] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:48,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:48,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:48,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588503779] [2021-10-28 22:46:48,242 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:48,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:48,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:48,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:48,248 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. cyclomatic complexity: 116 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:48,292 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2021-10-28 22:46:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:48,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 582 transitions. [2021-10-28 22:46:48,299 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-10-28 22:46:48,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 582 transitions. [2021-10-28 22:46:48,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2021-10-28 22:46:48,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2021-10-28 22:46:48,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 582 transitions. [2021-10-28 22:46:48,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:46:48,329 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-10-28 22:46:48,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 582 transitions. [2021-10-28 22:46:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-10-28 22:46:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.5901639344262295) internal successors, (582), 365 states have internal predecessors, (582), 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 22:46:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2021-10-28 22:46:48,356 INFO L704 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-10-28 22:46:48,356 INFO L587 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-10-28 22:46:48,356 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-28 22:46:48,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 582 transitions. [2021-10-28 22:46:48,360 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-10-28 22:46:48,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:48,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:48,361 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:48,361 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:48,362 INFO L791 eck$LassoCheckResult]: Stem: 1067#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1057#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 1058#L225-1 [2021-10-28 22:46:48,362 INFO L793 eck$LassoCheckResult]: Loop: 1058#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 1096#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1092#L93 assume !(0 != main_~p1~0); 1085#L93-2 assume !(0 != main_~p2~0); 1086#L97-1 assume !(0 != main_~p3~0); 1237#L101-1 assume !(0 != main_~p4~0); 1234#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1232#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1228#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1224#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1220#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1216#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1212#L129-1 assume !(0 != main_~p11~0); 1208#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1204#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1200#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1196#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1190#L149-1 assume !(0 != main_~p1~0); 1188#L155-1 assume !(0 != main_~p2~0); 1187#L160-1 assume !(0 != main_~p3~0); 1182#L165-1 assume !(0 != main_~p4~0); 1175#L170-1 assume !(0 != main_~p5~0); 1127#L175-1 assume !(0 != main_~p6~0); 1123#L180-1 assume !(0 != main_~p7~0); 1120#L185-1 assume !(0 != main_~p8~0); 1119#L190-1 assume !(0 != main_~p9~0); 1117#L195-1 assume !(0 != main_~p10~0); 1115#L200-1 assume !(0 != main_~p11~0); 1113#L205-1 assume !(0 != main_~p12~0); 1111#L210-1 assume !(0 != main_~p13~0); 1109#L215-1 assume !(0 != main_~p14~0); 1107#L220-1 assume !(0 != main_~p15~0); 1058#L225-1 [2021-10-28 22:46:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:48,363 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-28 22:46:48,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:48,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995715510] [2021-10-28 22:46:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:48,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:48,376 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:48,391 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1101649480, now seen corresponding path program 1 times [2021-10-28 22:46:48,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:48,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858596354] [2021-10-28 22:46:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:48,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:48,440 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 22:46:48,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:48,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858596354] [2021-10-28 22:46:48,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858596354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:48,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:48,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:48,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703416303] [2021-10-28 22:46:48,443 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:48,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:48,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:48,447 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. cyclomatic complexity: 224 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:48,487 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2021-10-28 22:46:48,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:48,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1138 transitions. [2021-10-28 22:46:48,498 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-10-28 22:46:48,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1138 transitions. [2021-10-28 22:46:48,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2021-10-28 22:46:48,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2021-10-28 22:46:48,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1138 transitions. [2021-10-28 22:46:48,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:46:48,517 INFO L681 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-10-28 22:46:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1138 transitions. [2021-10-28 22:46:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2021-10-28 22:46:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5761772853185596) internal successors, (1138), 721 states have internal predecessors, (1138), 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 22:46:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1138 transitions. [2021-10-28 22:46:48,560 INFO L704 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-10-28 22:46:48,560 INFO L587 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-10-28 22:46:48,560 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-28 22:46:48,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1138 transitions. [2021-10-28 22:46:48,567 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-10-28 22:46:48,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:48,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:48,568 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:48,569 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:48,569 INFO L791 eck$LassoCheckResult]: Stem: 2156#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2149#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 2150#L225-1 [2021-10-28 22:46:48,569 INFO L793 eck$LassoCheckResult]: Loop: 2150#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 2251#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 2247#L93 assume !(0 != main_~p1~0); 2240#L93-2 assume !(0 != main_~p2~0); 2235#L97-1 assume !(0 != main_~p3~0); 2228#L101-1 assume !(0 != main_~p4~0); 2222#L105-1 assume !(0 != main_~p5~0); 2218#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2216#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2214#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2212#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2210#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2207#L129-1 assume !(0 != main_~p11~0); 2208#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2201#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2202#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2194#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2195#L149-1 assume !(0 != main_~p1~0); 2184#L155-1 assume !(0 != main_~p2~0); 2186#L160-1 assume !(0 != main_~p3~0); 2363#L165-1 assume !(0 != main_~p4~0); 2351#L170-1 assume !(0 != main_~p5~0); 2350#L175-1 assume !(0 != main_~p6~0); 2348#L180-1 assume !(0 != main_~p7~0); 2344#L185-1 assume !(0 != main_~p8~0); 2339#L190-1 assume !(0 != main_~p9~0); 2333#L195-1 assume !(0 != main_~p10~0); 2282#L200-1 assume !(0 != main_~p11~0); 2280#L205-1 assume !(0 != main_~p12~0); 2274#L210-1 assume !(0 != main_~p13~0); 2270#L215-1 assume !(0 != main_~p14~0); 2260#L220-1 assume !(0 != main_~p15~0); 2150#L225-1 [2021-10-28 22:46:48,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:48,570 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-10-28 22:46:48,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:48,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558036131] [2021-10-28 22:46:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:48,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:48,583 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:48,597 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:48,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:48,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1163689094, now seen corresponding path program 1 times [2021-10-28 22:46:48,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:48,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192525963] [2021-10-28 22:46:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:48,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:48,655 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 22:46:48,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:48,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192525963] [2021-10-28 22:46:48,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192525963] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:48,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:48,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:48,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134225329] [2021-10-28 22:46:48,657 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:48,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:48,658 INFO L87 Difference]: Start difference. First operand 722 states and 1138 transitions. cyclomatic complexity: 432 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:48,686 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2021-10-28 22:46:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:48,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2226 transitions. [2021-10-28 22:46:48,707 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-10-28 22:46:48,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2226 transitions. [2021-10-28 22:46:48,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2021-10-28 22:46:48,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2021-10-28 22:46:48,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2226 transitions. [2021-10-28 22:46:48,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:46:48,727 INFO L681 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-10-28 22:46:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2226 transitions. [2021-10-28 22:46:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2021-10-28 22:46:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5610098176718092) internal successors, (2226), 1425 states have internal predecessors, (2226), 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 22:46:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2226 transitions. [2021-10-28 22:46:48,789 INFO L704 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-10-28 22:46:48,789 INFO L587 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-10-28 22:46:48,789 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-28 22:46:48,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2226 transitions. [2021-10-28 22:46:48,800 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-10-28 22:46:48,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:48,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:48,802 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:48,803 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:48,803 INFO L791 eck$LassoCheckResult]: Stem: 4313#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4305#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 4306#L225-1 [2021-10-28 22:46:48,803 INFO L793 eck$LassoCheckResult]: Loop: 4306#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 4520#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4521#L93 assume !(0 != main_~p1~0); 4734#L93-2 assume !(0 != main_~p2~0); 4733#L97-1 assume !(0 != main_~p3~0); 4731#L101-1 assume !(0 != main_~p4~0); 4728#L105-1 assume !(0 != main_~p5~0); 4724#L109-1 assume !(0 != main_~p6~0); 4722#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4720#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4718#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4716#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4714#L129-1 assume !(0 != main_~p11~0); 4712#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4710#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4708#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4706#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4703#L149-1 assume !(0 != main_~p1~0); 4704#L155-1 assume !(0 != main_~p2~0); 4753#L160-1 assume !(0 != main_~p3~0); 4654#L165-1 assume !(0 != main_~p4~0); 4655#L170-1 assume !(0 != main_~p5~0); 4643#L175-1 assume !(0 != main_~p6~0); 4645#L180-1 assume !(0 != main_~p7~0); 4627#L185-1 assume !(0 != main_~p8~0); 4628#L190-1 assume !(0 != main_~p9~0); 4612#L195-1 assume !(0 != main_~p10~0); 4611#L200-1 assume !(0 != main_~p11~0); 4595#L205-1 assume !(0 != main_~p12~0); 4587#L210-1 assume !(0 != main_~p13~0); 4586#L215-1 assume !(0 != main_~p14~0); 4540#L220-1 assume !(0 != main_~p15~0); 4306#L225-1 [2021-10-28 22:46:48,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-10-28 22:46:48,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:48,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749051860] [2021-10-28 22:46:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:48,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:48,835 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:48,862 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:48,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:48,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1304237704, now seen corresponding path program 1 times [2021-10-28 22:46:48,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:48,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398720394] [2021-10-28 22:46:48,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:48,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:48,923 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 22:46:48,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:48,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398720394] [2021-10-28 22:46:48,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398720394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:48,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:48,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:48,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59905523] [2021-10-28 22:46:48,926 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:48,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:48,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:48,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:48,929 INFO L87 Difference]: Start difference. First operand 1426 states and 2226 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:48,963 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2021-10-28 22:46:48,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:48,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4354 transitions. [2021-10-28 22:46:49,000 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-10-28 22:46:49,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4354 transitions. [2021-10-28 22:46:49,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2021-10-28 22:46:49,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2021-10-28 22:46:49,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4354 transitions. [2021-10-28 22:46:49,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:46:49,040 INFO L681 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-10-28 22:46:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4354 transitions. [2021-10-28 22:46:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2021-10-28 22:46:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.5450674237047552) internal successors, (4354), 2817 states have internal predecessors, (4354), 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 22:46:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4354 transitions. [2021-10-28 22:46:49,123 INFO L704 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-10-28 22:46:49,124 INFO L587 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-10-28 22:46:49,124 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-28 22:46:49,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4354 transitions. [2021-10-28 22:46:49,171 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-10-28 22:46:49,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:49,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:49,175 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:49,176 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:49,176 INFO L791 eck$LassoCheckResult]: Stem: 8576#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8562#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 8563#L225-1 [2021-10-28 22:46:49,177 INFO L793 eck$LassoCheckResult]: Loop: 8563#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 8727#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 8725#L93 assume !(0 != main_~p1~0); 8724#L93-2 assume !(0 != main_~p2~0); 8718#L97-1 assume !(0 != main_~p3~0); 8719#L101-1 assume !(0 != main_~p4~0); 8825#L105-1 assume !(0 != main_~p5~0); 8822#L109-1 assume !(0 != main_~p6~0); 8818#L113-1 assume !(0 != main_~p7~0); 8816#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8815#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8812#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8809#L129-1 assume !(0 != main_~p11~0); 8806#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8802#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8798#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8793#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8787#L149-1 assume !(0 != main_~p1~0); 8781#L155-1 assume !(0 != main_~p2~0); 8776#L160-1 assume !(0 != main_~p3~0); 8769#L165-1 assume !(0 != main_~p4~0); 8763#L170-1 assume !(0 != main_~p5~0); 8758#L175-1 assume !(0 != main_~p6~0); 8756#L180-1 assume !(0 != main_~p7~0); 8750#L185-1 assume !(0 != main_~p8~0); 8747#L190-1 assume !(0 != main_~p9~0); 8743#L195-1 assume !(0 != main_~p10~0); 8737#L200-1 assume !(0 != main_~p11~0); 8735#L205-1 assume !(0 != main_~p12~0); 8733#L210-1 assume !(0 != main_~p13~0); 8731#L215-1 assume !(0 != main_~p14~0); 8729#L220-1 assume !(0 != main_~p15~0); 8563#L225-1 [2021-10-28 22:46:49,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:49,181 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-10-28 22:46:49,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:49,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115595219] [2021-10-28 22:46:49,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:49,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:49,203 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:49,224 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:49,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1170224198, now seen corresponding path program 1 times [2021-10-28 22:46:49,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:49,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740640652] [2021-10-28 22:46:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:49,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:49,291 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 22:46:49,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:49,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740640652] [2021-10-28 22:46:49,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740640652] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:49,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:49,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:49,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824111370] [2021-10-28 22:46:49,293 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:49,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:49,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:49,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:49,295 INFO L87 Difference]: Start difference. First operand 2818 states and 4354 transitions. cyclomatic complexity: 1600 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:49,345 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2021-10-28 22:46:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:49,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8514 transitions. [2021-10-28 22:46:49,405 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-10-28 22:46:49,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8514 transitions. [2021-10-28 22:46:49,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2021-10-28 22:46:49,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2021-10-28 22:46:49,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8514 transitions. [2021-10-28 22:46:49,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:46:49,475 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-10-28 22:46:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8514 transitions. [2021-10-28 22:46:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2021-10-28 22:46:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.5285457809694794) internal successors, (8514), 5569 states have internal predecessors, (8514), 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 22:46:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8514 transitions. [2021-10-28 22:46:49,671 INFO L704 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-10-28 22:46:49,671 INFO L587 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-10-28 22:46:49,672 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-28 22:46:49,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8514 transitions. [2021-10-28 22:46:49,704 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-10-28 22:46:49,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:49,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:49,706 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:49,706 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:49,706 INFO L791 eck$LassoCheckResult]: Stem: 16963#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 16949#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 16950#L225-1 [2021-10-28 22:46:49,706 INFO L793 eck$LassoCheckResult]: Loop: 16950#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 17206#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 17200#L93 assume !(0 != main_~p1~0); 17196#L93-2 assume !(0 != main_~p2~0); 17193#L97-1 assume !(0 != main_~p3~0); 17187#L101-1 assume !(0 != main_~p4~0); 17181#L105-1 assume !(0 != main_~p5~0); 17177#L109-1 assume !(0 != main_~p6~0); 17172#L113-1 assume !(0 != main_~p7~0); 17166#L117-1 assume !(0 != main_~p8~0); 17167#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 17154#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 17155#L129-1 assume !(0 != main_~p11~0); 17146#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 17147#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 17138#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 17139#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 17128#L149-1 assume !(0 != main_~p1~0); 17129#L155-1 assume !(0 != main_~p2~0); 17118#L160-1 assume !(0 != main_~p3~0); 17117#L165-1 assume !(0 != main_~p4~0); 17104#L170-1 assume !(0 != main_~p5~0); 17105#L175-1 assume !(0 != main_~p6~0); 17095#L180-1 assume !(0 != main_~p7~0); 17096#L185-1 assume !(0 != main_~p8~0); 17248#L190-1 assume !(0 != main_~p9~0); 17244#L195-1 assume !(0 != main_~p10~0); 17240#L200-1 assume !(0 != main_~p11~0); 17234#L205-1 assume !(0 != main_~p12~0); 17228#L210-1 assume !(0 != main_~p13~0); 17222#L215-1 assume !(0 != main_~p14~0); 17216#L220-1 assume !(0 != main_~p15~0); 16950#L225-1 [2021-10-28 22:46:49,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:49,707 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-10-28 22:46:49,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:49,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078172780] [2021-10-28 22:46:49,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:49,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:49,717 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:49,728 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:49,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash -635214136, now seen corresponding path program 1 times [2021-10-28 22:46:49,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:49,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129969120] [2021-10-28 22:46:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:49,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:49,755 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 22:46:49,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:49,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129969120] [2021-10-28 22:46:49,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129969120] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:49,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:49,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:49,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143647656] [2021-10-28 22:46:49,757 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:49,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:49,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:49,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:49,759 INFO L87 Difference]: Start difference. First operand 5570 states and 8514 transitions. cyclomatic complexity: 3072 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:49,881 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2021-10-28 22:46:49,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:49,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16642 transitions. [2021-10-28 22:46:49,982 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-10-28 22:46:50,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16642 transitions. [2021-10-28 22:46:50,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2021-10-28 22:46:50,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2021-10-28 22:46:50,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16642 transitions. [2021-10-28 22:46:50,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:46:50,147 INFO L681 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-10-28 22:46:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16642 transitions. [2021-10-28 22:46:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2021-10-28 22:46:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.5115349682107175) internal successors, (16642), 11009 states have internal predecessors, (16642), 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 22:46:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16642 transitions. [2021-10-28 22:46:50,559 INFO L704 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-10-28 22:46:50,560 INFO L587 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-10-28 22:46:50,560 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-28 22:46:50,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16642 transitions. [2021-10-28 22:46:50,709 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-10-28 22:46:50,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:50,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:50,711 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:50,711 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:50,712 INFO L791 eck$LassoCheckResult]: Stem: 33547#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 33535#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 33536#L225-1 [2021-10-28 22:46:50,714 INFO L793 eck$LassoCheckResult]: Loop: 33536#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 34190#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 34191#L93 assume !(0 != main_~p1~0); 34313#L93-2 assume !(0 != main_~p2~0); 34311#L97-1 assume !(0 != main_~p3~0); 34307#L101-1 assume !(0 != main_~p4~0); 34304#L105-1 assume !(0 != main_~p5~0); 34302#L109-1 assume !(0 != main_~p6~0); 34298#L113-1 assume !(0 != main_~p7~0); 34294#L117-1 assume !(0 != main_~p8~0); 34290#L121-1 assume !(0 != main_~p9~0); 34288#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 34286#L129-1 assume !(0 != main_~p11~0); 34284#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 34282#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 34280#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 34278#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 34274#L149-1 assume !(0 != main_~p1~0); 34270#L155-1 assume !(0 != main_~p2~0); 34267#L160-1 assume !(0 != main_~p3~0); 34262#L165-1 assume !(0 != main_~p4~0); 34258#L170-1 assume !(0 != main_~p5~0); 34256#L175-1 assume !(0 != main_~p6~0); 34233#L180-1 assume !(0 != main_~p7~0); 34234#L185-1 assume !(0 != main_~p8~0); 34227#L190-1 assume !(0 != main_~p9~0); 34229#L195-1 assume !(0 != main_~p10~0); 34223#L200-1 assume !(0 != main_~p11~0); 34222#L205-1 assume !(0 != main_~p12~0); 34217#L210-1 assume !(0 != main_~p13~0); 34216#L215-1 assume !(0 != main_~p14~0); 34208#L220-1 assume !(0 != main_~p15~0); 33536#L225-1 [2021-10-28 22:46:50,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-10-28 22:46:50,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:50,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664396364] [2021-10-28 22:46:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:50,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:50,729 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:50,757 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:50,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:50,762 INFO L85 PathProgramCache]: Analyzing trace with hash -416359418, now seen corresponding path program 1 times [2021-10-28 22:46:50,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:50,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818910731] [2021-10-28 22:46:50,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:50,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:50,807 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 22:46:50,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:50,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818910731] [2021-10-28 22:46:50,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818910731] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:50,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:50,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:50,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862687207] [2021-10-28 22:46:50,810 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:50,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:50,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:50,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:50,811 INFO L87 Difference]: Start difference. First operand 11010 states and 16642 transitions. cyclomatic complexity: 5888 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:50,895 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2021-10-28 22:46:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:50,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 32514 transitions. [2021-10-28 22:46:51,147 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-10-28 22:46:51,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 32514 transitions. [2021-10-28 22:46:51,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2021-10-28 22:46:51,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2021-10-28 22:46:51,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 32514 transitions. [2021-10-28 22:46:51,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:46:51,332 INFO L681 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-10-28 22:46:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 32514 transitions. [2021-10-28 22:46:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2021-10-28 22:46:51,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.4940722360077199) internal successors, (32514), 21761 states have internal predecessors, (32514), 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 22:46:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 32514 transitions. [2021-10-28 22:46:51,992 INFO L704 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-10-28 22:46:51,992 INFO L587 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-10-28 22:46:51,992 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-28 22:46:51,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 32514 transitions. [2021-10-28 22:46:52,075 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-10-28 22:46:52,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:52,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:52,076 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:52,076 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:52,077 INFO L791 eck$LassoCheckResult]: Stem: 66322#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 66310#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 66311#L225-1 [2021-10-28 22:46:52,077 INFO L793 eck$LassoCheckResult]: Loop: 66311#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 66629#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 66630#L93 assume !(0 != main_~p1~0); 66617#L93-2 assume !(0 != main_~p2~0); 66619#L97-1 assume !(0 != main_~p3~0); 66606#L101-1 assume !(0 != main_~p4~0); 66608#L105-1 assume !(0 != main_~p5~0); 66710#L109-1 assume !(0 != main_~p6~0); 66708#L113-1 assume !(0 != main_~p7~0); 66705#L117-1 assume !(0 != main_~p8~0); 66702#L121-1 assume !(0 != main_~p9~0); 66700#L125-1 assume !(0 != main_~p10~0); 66699#L129-1 assume !(0 != main_~p11~0); 66698#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 66697#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 66696#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 66694#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 66691#L149-1 assume !(0 != main_~p1~0); 66688#L155-1 assume !(0 != main_~p2~0); 66686#L160-1 assume !(0 != main_~p3~0); 66530#L165-1 assume !(0 != main_~p4~0); 66531#L170-1 assume !(0 != main_~p5~0); 66516#L175-1 assume !(0 != main_~p6~0); 66517#L180-1 assume !(0 != main_~p7~0); 66683#L185-1 assume !(0 != main_~p8~0); 66671#L190-1 assume !(0 != main_~p9~0); 66673#L195-1 assume !(0 != main_~p10~0); 66661#L200-1 assume !(0 != main_~p11~0); 66660#L205-1 assume !(0 != main_~p12~0); 66651#L210-1 assume !(0 != main_~p13~0); 66650#L215-1 assume !(0 != main_~p14~0); 66639#L220-1 assume !(0 != main_~p15~0); 66311#L225-1 [2021-10-28 22:46:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-10-28 22:46:52,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:52,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396086124] [2021-10-28 22:46:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:52,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:52,089 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:52,103 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 6342408, now seen corresponding path program 1 times [2021-10-28 22:46:52,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:52,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051365047] [2021-10-28 22:46:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:52,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:52,136 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 22:46:52,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:52,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051365047] [2021-10-28 22:46:52,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051365047] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:52,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:52,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:52,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004252784] [2021-10-28 22:46:52,139 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:52,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:52,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:52,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:52,141 INFO L87 Difference]: Start difference. First operand 21762 states and 32514 transitions. cyclomatic complexity: 11264 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:52,459 INFO L93 Difference]: Finished difference Result 43010 states and 63490 transitions. [2021-10-28 22:46:52,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:52,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 63490 transitions. [2021-10-28 22:46:52,880 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-10-28 22:46:53,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 63490 transitions. [2021-10-28 22:46:53,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2021-10-28 22:46:53,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2021-10-28 22:46:53,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 63490 transitions. [2021-10-28 22:46:53,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:46:53,260 INFO L681 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-10-28 22:46:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 63490 transitions. [2021-10-28 22:46:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2021-10-28 22:46:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4761683329458266) internal successors, (63490), 43009 states have internal predecessors, (63490), 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 22:46:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 63490 transitions. [2021-10-28 22:46:54,142 INFO L704 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-10-28 22:46:54,143 INFO L587 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-10-28 22:46:54,143 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-28 22:46:54,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 63490 transitions. [2021-10-28 22:46:54,491 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-10-28 22:46:54,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:54,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:54,492 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:54,492 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:54,493 INFO L791 eck$LassoCheckResult]: Stem: 131098#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 131087#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 131088#L225-1 [2021-10-28 22:46:54,493 INFO L793 eck$LassoCheckResult]: Loop: 131088#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 131568#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 131565#L93 assume !(0 != main_~p1~0); 131561#L93-2 assume !(0 != main_~p2~0); 131558#L97-1 assume !(0 != main_~p3~0); 131547#L101-1 assume !(0 != main_~p4~0); 131536#L105-1 assume !(0 != main_~p5~0); 131527#L109-1 assume !(0 != main_~p6~0); 131517#L113-1 assume !(0 != main_~p7~0); 131511#L117-1 assume !(0 != main_~p8~0); 131505#L121-1 assume !(0 != main_~p9~0); 131498#L125-1 assume !(0 != main_~p10~0); 131493#L129-1 assume !(0 != main_~p11~0); 131423#L133-1 assume !(0 != main_~p12~0); 131424#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 131409#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 131410#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 131392#L149-1 assume !(0 != main_~p1~0); 131393#L155-1 assume !(0 != main_~p2~0); 131373#L160-1 assume !(0 != main_~p3~0); 131372#L165-1 assume !(0 != main_~p4~0); 131349#L170-1 assume !(0 != main_~p5~0); 131350#L175-1 assume !(0 != main_~p6~0); 131327#L180-1 assume !(0 != main_~p7~0); 131328#L185-1 assume !(0 != main_~p8~0); 131309#L190-1 assume !(0 != main_~p9~0); 131311#L195-1 assume !(0 != main_~p10~0); 131469#L200-1 assume !(0 != main_~p11~0); 131464#L205-1 assume !(0 != main_~p12~0); 131465#L210-1 assume !(0 != main_~p13~0); 131576#L215-1 assume !(0 != main_~p14~0); 131573#L220-1 assume !(0 != main_~p15~0); 131088#L225-1 [2021-10-28 22:46:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:54,494 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-10-28 22:46:54,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:54,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052766176] [2021-10-28 22:46:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:54,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:54,501 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:54,513 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:54,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1682601334, now seen corresponding path program 1 times [2021-10-28 22:46:54,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:54,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872647682] [2021-10-28 22:46:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:54,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:54,545 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 22:46:54,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:54,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872647682] [2021-10-28 22:46:54,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872647682] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:54,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:54,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:54,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458410567] [2021-10-28 22:46:54,547 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:54,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:54,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:54,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:54,549 INFO L87 Difference]: Start difference. First operand 43010 states and 63490 transitions. cyclomatic complexity: 21504 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:55,008 INFO L93 Difference]: Finished difference Result 84994 states and 123906 transitions. [2021-10-28 22:46:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:55,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 123906 transitions. [2021-10-28 22:46:55,623 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-10-28 22:46:55,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 123906 transitions. [2021-10-28 22:46:55,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2021-10-28 22:46:55,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2021-10-28 22:46:55,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 123906 transitions. [2021-10-28 22:46:56,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:46:56,047 INFO L681 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-10-28 22:46:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 123906 transitions. [2021-10-28 22:46:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2021-10-28 22:46:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.4578205520389675) internal successors, (123906), 84993 states have internal predecessors, (123906), 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 22:46:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 123906 transitions. [2021-10-28 22:46:57,641 INFO L704 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-10-28 22:46:57,641 INFO L587 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-10-28 22:46:57,641 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-10-28 22:46:57,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 123906 transitions. [2021-10-28 22:46:57,875 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-10-28 22:46:57,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:46:57,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:46:57,876 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:46:57,877 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:46:57,877 INFO L791 eck$LassoCheckResult]: Stem: 259116#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 259105#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 259106#L225-1 [2021-10-28 22:46:57,877 INFO L793 eck$LassoCheckResult]: Loop: 259106#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 260093#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 260071#L93 assume !(0 != main_~p1~0); 260073#L93-2 assume !(0 != main_~p2~0); 260053#L97-1 assume !(0 != main_~p3~0); 260054#L101-1 assume !(0 != main_~p4~0); 260027#L105-1 assume !(0 != main_~p5~0); 260029#L109-1 assume !(0 != main_~p6~0); 260313#L113-1 assume !(0 != main_~p7~0); 260283#L117-1 assume !(0 != main_~p8~0); 260285#L121-1 assume !(0 != main_~p9~0); 260309#L125-1 assume !(0 != main_~p10~0); 260308#L129-1 assume !(0 != main_~p11~0); 260306#L133-1 assume !(0 != main_~p12~0); 260304#L137-1 assume !(0 != main_~p13~0); 260302#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 260300#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 260297#L149-1 assume !(0 != main_~p1~0); 260293#L155-1 assume !(0 != main_~p2~0); 260290#L160-1 assume !(0 != main_~p3~0); 260225#L165-1 assume !(0 != main_~p4~0); 260226#L170-1 assume !(0 != main_~p5~0); 260202#L175-1 assume !(0 != main_~p6~0); 260204#L180-1 assume !(0 != main_~p7~0); 260181#L185-1 assume !(0 != main_~p8~0); 260182#L190-1 assume !(0 != main_~p9~0); 260176#L195-1 assume !(0 != main_~p10~0); 260178#L200-1 assume !(0 != main_~p11~0); 260125#L205-1 assume !(0 != main_~p12~0); 260127#L210-1 assume !(0 != main_~p13~0); 260112#L215-1 assume !(0 != main_~p14~0); 260111#L220-1 assume !(0 != main_~p15~0); 259106#L225-1 [2021-10-28 22:46:57,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:57,878 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-10-28 22:46:57,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:57,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373165061] [2021-10-28 22:46:57,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:57,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:57,887 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:46:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:46:57,896 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:46:57,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:46:57,897 INFO L85 PathProgramCache]: Analyzing trace with hash 618221256, now seen corresponding path program 1 times [2021-10-28 22:46:57,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:46:57,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234636603] [2021-10-28 22:46:57,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:46:57,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:46:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:46:57,919 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 22:46:57,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:46:57,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234636603] [2021-10-28 22:46:57,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234636603] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:46:57,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:46:57,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:46:57,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772626121] [2021-10-28 22:46:57,921 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:46:57,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:46:57,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:46:57,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:46:57,923 INFO L87 Difference]: Start difference. First operand 84994 states and 123906 transitions. cyclomatic complexity: 40960 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:46:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:46:58,462 INFO L93 Difference]: Finished difference Result 167938 states and 241666 transitions. [2021-10-28 22:46:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:46:58,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167938 states and 241666 transitions. [2021-10-28 22:46:59,849 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2021-10-28 22:47:00,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167938 states to 167938 states and 241666 transitions. [2021-10-28 22:47:00,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167938 [2021-10-28 22:47:00,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167938 [2021-10-28 22:47:00,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167938 states and 241666 transitions. [2021-10-28 22:47:00,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:47:00,514 INFO L681 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-10-28 22:47:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167938 states and 241666 transitions. [2021-10-28 22:47:02,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167938 to 167938. [2021-10-28 22:47:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167938 states, 167938 states have (on average 1.4390191618335337) internal successors, (241666), 167937 states have internal predecessors, (241666), 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 22:47:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167938 states to 167938 states and 241666 transitions. [2021-10-28 22:47:03,533 INFO L704 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-10-28 22:47:03,533 INFO L587 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-10-28 22:47:03,533 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-10-28 22:47:03,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167938 states and 241666 transitions. [2021-10-28 22:47:04,033 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2021-10-28 22:47:04,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:47:04,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:47:04,035 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:47:04,035 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:04,035 INFO L791 eck$LassoCheckResult]: Stem: 512052#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 512037#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 512038#L225-1 [2021-10-28 22:47:04,036 INFO L793 eck$LassoCheckResult]: Loop: 512038#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 512371#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 512369#L93 assume !(0 != main_~p1~0); 512367#L93-2 assume !(0 != main_~p2~0); 512366#L97-1 assume !(0 != main_~p3~0); 512364#L101-1 assume !(0 != main_~p4~0); 512362#L105-1 assume !(0 != main_~p5~0); 512360#L109-1 assume !(0 != main_~p6~0); 512358#L113-1 assume !(0 != main_~p7~0); 512356#L117-1 assume !(0 != main_~p8~0); 512354#L121-1 assume !(0 != main_~p9~0); 512352#L125-1 assume !(0 != main_~p10~0); 512351#L129-1 assume !(0 != main_~p11~0); 512349#L133-1 assume !(0 != main_~p12~0); 512345#L137-1 assume !(0 != main_~p13~0); 512343#L141-1 assume !(0 != main_~p14~0); 512340#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 512336#L149-1 assume !(0 != main_~p1~0); 512330#L155-1 assume !(0 != main_~p2~0); 512325#L160-1 assume !(0 != main_~p3~0); 512318#L165-1 assume !(0 != main_~p4~0); 512312#L170-1 assume !(0 != main_~p5~0); 512306#L175-1 assume !(0 != main_~p6~0); 512300#L180-1 assume !(0 != main_~p7~0); 512294#L185-1 assume !(0 != main_~p8~0); 512288#L190-1 assume !(0 != main_~p9~0); 512282#L195-1 assume !(0 != main_~p10~0); 512277#L200-1 assume !(0 != main_~p11~0); 512270#L205-1 assume !(0 != main_~p12~0); 512261#L210-1 assume !(0 != main_~p13~0); 512262#L215-1 assume !(0 != main_~p14~0); 512373#L220-1 assume !(0 != main_~p15~0); 512038#L225-1 [2021-10-28 22:47:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2021-10-28 22:47:04,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:04,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59628475] [2021-10-28 22:47:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:04,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:47:04,043 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:47:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:47:04,052 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:47:04,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:04,053 INFO L85 PathProgramCache]: Analyzing trace with hash -970126646, now seen corresponding path program 1 times [2021-10-28 22:47:04,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:04,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708128798] [2021-10-28 22:47:04,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:04,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:04,073 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 22:47:04,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:04,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708128798] [2021-10-28 22:47:04,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708128798] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:04,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:04,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 22:47:04,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610153813] [2021-10-28 22:47:04,075 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 22:47:04,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:04,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:04,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:04,076 INFO L87 Difference]: Start difference. First operand 167938 states and 241666 transitions. cyclomatic complexity: 77824 Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 22:47:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:05,695 INFO L93 Difference]: Finished difference Result 331778 states and 471042 transitions. [2021-10-28 22:47:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:05,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331778 states and 471042 transitions. [2021-10-28 22:47:07,519 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2021-10-28 22:47:08,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331778 states to 331778 states and 471042 transitions. [2021-10-28 22:47:08,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331778 [2021-10-28 22:47:08,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331778 [2021-10-28 22:47:08,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331778 states and 471042 transitions. [2021-10-28 22:47:08,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:47:08,446 INFO L681 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-10-28 22:47:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331778 states and 471042 transitions. [2021-10-28 22:47:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331778 to 331778. [2021-10-28 22:47:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331778 states, 331778 states have (on average 1.419750556094738) internal successors, (471042), 331777 states have internal predecessors, (471042), 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 22:47:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331778 states to 331778 states and 471042 transitions. [2021-10-28 22:47:14,722 INFO L704 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-10-28 22:47:14,723 INFO L587 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-10-28 22:47:14,723 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-10-28 22:47:14,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331778 states and 471042 transitions. [2021-10-28 22:47:15,691 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2021-10-28 22:47:15,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 22:47:15,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 22:47:15,696 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 22:47:15,696 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:15,696 INFO L791 eck$LassoCheckResult]: Stem: 1011773#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1011759#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 1011760#L225-1 [2021-10-28 22:47:15,696 INFO L793 eck$LassoCheckResult]: Loop: 1011760#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 1012553#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1012551#L93 assume !(0 != main_~p1~0); 1012549#L93-2 assume !(0 != main_~p2~0); 1012548#L97-1 assume !(0 != main_~p3~0); 1012546#L101-1 assume !(0 != main_~p4~0); 1012544#L105-1 assume !(0 != main_~p5~0); 1012545#L109-1 assume !(0 != main_~p6~0); 1012707#L113-1 assume !(0 != main_~p7~0); 1012702#L117-1 assume !(0 != main_~p8~0); 1012697#L121-1 assume !(0 != main_~p9~0); 1012691#L125-1 assume !(0 != main_~p10~0); 1012687#L129-1 assume !(0 != main_~p11~0); 1012683#L133-1 assume !(0 != main_~p12~0); 1012678#L137-1 assume !(0 != main_~p13~0); 1012674#L141-1 assume !(0 != main_~p14~0); 1012668#L145-1 assume !(0 != main_~p15~0); 1012661#L149-1 assume !(0 != main_~p1~0); 1012653#L155-1 assume !(0 != main_~p2~0); 1012642#L160-1 assume !(0 != main_~p3~0); 1012638#L165-1 assume !(0 != main_~p4~0); 1012636#L170-1 assume !(0 != main_~p5~0); 1012632#L175-1 assume !(0 != main_~p6~0); 1012628#L180-1 assume !(0 != main_~p7~0); 1012624#L185-1 assume !(0 != main_~p8~0); 1012620#L190-1 assume !(0 != main_~p9~0); 1012616#L195-1 assume !(0 != main_~p10~0); 1012570#L200-1 assume !(0 != main_~p11~0); 1012560#L205-1 assume !(0 != main_~p12~0); 1012558#L210-1 assume !(0 != main_~p13~0); 1012556#L215-1 assume !(0 != main_~p14~0); 1012554#L220-1 assume !(0 != main_~p15~0); 1011760#L225-1 [2021-10-28 22:47:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2021-10-28 22:47:15,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:15,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387110409] [2021-10-28 22:47:15,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:15,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:47:15,715 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:47:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:47:15,727 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:47:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:15,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1991195000, now seen corresponding path program 1 times [2021-10-28 22:47:15,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:15,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840418897] [2021-10-28 22:47:15,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:15,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:47:15,734 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:47:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:47:15,749 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:47:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1845576266, now seen corresponding path program 1 times [2021-10-28 22:47:15,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:15,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112451536] [2021-10-28 22:47:15,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:15,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:47:15,766 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:47:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:47:15,783 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:47:16,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.10 10:47:16 BoogieIcfgContainer [2021-10-28 22:47:16,711 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-28 22:47:16,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 22:47:16,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 22:47:16,712 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 22:47:16,713 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:46:47" (3/4) ... [2021-10-28 22:47:16,715 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-28 22:47:16,771 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 22:47:16,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 22:47:16,773 INFO L168 Benchmark]: Toolchain (without parser) took 30556.46 ms. Allocated memory was 107.0 MB in the beginning and 13.6 GB in the end (delta: 13.5 GB). Free memory was 64.9 MB in the beginning and 10.4 GB in the end (delta: -10.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 16.1 GB. [2021-10-28 22:47:16,773 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 107.0 MB. Free memory is still 81.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 22:47:16,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.84 ms. Allocated memory is still 107.0 MB. Free memory was 64.7 MB in the beginning and 53.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:16,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.83 ms. Allocated memory is still 107.0 MB. Free memory was 53.8 MB in the beginning and 52.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:16,775 INFO L168 Benchmark]: Boogie Preprocessor took 37.31 ms. Allocated memory is still 107.0 MB. Free memory was 52.1 MB in the beginning and 50.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:16,775 INFO L168 Benchmark]: RCFGBuilder took 547.25 ms. Allocated memory is still 107.0 MB. Free memory was 50.6 MB in the beginning and 75.0 MB in the end (delta: -24.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:16,776 INFO L168 Benchmark]: BuchiAutomizer took 29582.87 ms. Allocated memory was 107.0 MB in the beginning and 13.6 GB in the end (delta: 13.5 GB). Free memory was 74.7 MB in the beginning and 10.4 GB in the end (delta: -10.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 16.1 GB. [2021-10-28 22:47:16,776 INFO L168 Benchmark]: Witness Printer took 59.70 ms. Allocated memory is still 13.6 GB. Free memory was 10.4 GB in the beginning and 10.4 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:16,779 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.30 ms. Allocated memory is still 107.0 MB. Free memory is still 81.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 275.84 ms. Allocated memory is still 107.0 MB. Free memory was 64.7 MB in the beginning and 53.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.83 ms. Allocated memory is still 107.0 MB. Free memory was 53.8 MB in the beginning and 52.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.31 ms. Allocated memory is still 107.0 MB. Free memory was 52.1 MB in the beginning and 50.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 547.25 ms. Allocated memory is still 107.0 MB. Free memory was 50.6 MB in the beginning and 75.0 MB in the end (delta: -24.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 29582.87 ms. Allocated memory was 107.0 MB in the beginning and 13.6 GB in the end (delta: 13.5 GB). Free memory was 74.7 MB in the beginning and 10.4 GB in the end (delta: -10.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 16.1 GB. * Witness Printer took 59.70 ms. Allocated memory is still 13.6 GB. Free memory was 10.4 GB in the beginning and 10.4 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 331778 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.4s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 13.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 6.8s Buchi closure took 0.3s. Biggest automaton had 331778 states and ocurred in iteration 13. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1530 SDtfs, 799 SDslu, 967 SDs, 0 SdLazy, 65 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI13 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 56]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=24847} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=24847, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8756543=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@687e4924=0, p14=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33c1310e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57c1702b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71f4f3d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27d7a331=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31743168=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1affd37e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3983e21f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23aeab62=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=24850, \result=0, p2=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@351aae3f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79241ef5=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@120724fc=0, lk13=0, p15=0, lk15=0, p13=0, p11=0, lk11=0, cond=10, NULL=24849, NULL=0, NULL=24848, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1da4af84=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41b8c433=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1784e591=10, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND FALSE !(p14 != 0) [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND FALSE !(p14 != 0) [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-28 22:47:16,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8233cfe8-ab51-4c87-abc0-f504048b258c/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...