./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15-1.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_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/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_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/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_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 23:17:12,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:17:12,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:17:12,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:17:12,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:17:12,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:17:12,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:17:12,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:17:12,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:17:12,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:17:12,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:17:12,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:17:12,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:17:12,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:17:12,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:17:12,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:17:12,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:17:12,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:17:12,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:17:12,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:17:12,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:17:12,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:17:12,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:17:12,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:17:12,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:17:12,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:17:12,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:17:12,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:17:12,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:17:12,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:17:12,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:17:12,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:17:12,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:17:12,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:17:12,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:17:12,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:17:12,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:17:12,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:17:12,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:17:12,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:17:12,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:17:12,195 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-28 23:17:12,266 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:17:12,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:17:12,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:17:12,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:17:12,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:17:12,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:17:12,270 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:17:12,270 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-28 23:17:12,271 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-28 23:17:12,271 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-28 23:17:12,271 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-28 23:17:12,271 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-28 23:17:12,272 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-28 23:17:12,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:17:12,272 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:17:12,273 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 23:17:12,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:17:12,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:17:12,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:17:12,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-28 23:17:12,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-28 23:17:12,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-28 23:17:12,275 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:17:12,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:17:12,275 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-28 23:17:12,276 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:17:12,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-28 23:17:12,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:17:12,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:17:12,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:17:12,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:17:12,278 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:17:12,279 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-28 23:17:12,279 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_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/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_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2021-10-28 23:17:12,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:17:12,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:17:12,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:17:12,660 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:17:12,662 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:17:12,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/locks/test_locks_15-1.c [2021-10-28 23:17:12,782 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/data/9f052c36e/eba44b8e1687460f9dd3cfbcff631833/FLAG89c1b8561 [2021-10-28 23:17:13,446 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:17:13,447 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/sv-benchmarks/c/locks/test_locks_15-1.c [2021-10-28 23:17:13,458 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/data/9f052c36e/eba44b8e1687460f9dd3cfbcff631833/FLAG89c1b8561 [2021-10-28 23:17:13,766 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/data/9f052c36e/eba44b8e1687460f9dd3cfbcff631833 [2021-10-28 23:17:13,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:17:13,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:17:13,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:17:13,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:17:13,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:17:13,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:17:13" (1/1) ... [2021-10-28 23:17:13,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@514ed6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:13, skipping insertion in model container [2021-10-28 23:17:13,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:17:13" (1/1) ... [2021-10-28 23:17:13,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:17:13,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:17:14,104 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_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/sv-benchmarks/c/locks/test_locks_15-1.c[5654,5667] [2021-10-28 23:17:14,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:17:14,119 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:17:14,155 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_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/sv-benchmarks/c/locks/test_locks_15-1.c[5654,5667] [2021-10-28 23:17:14,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:17:14,171 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:17:14,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14 WrapperNode [2021-10-28 23:17:14,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:17:14,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:17:14,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:17:14,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:17:14,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14" (1/1) ... [2021-10-28 23:17:14,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14" (1/1) ... [2021-10-28 23:17:14,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:17:14,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:17:14,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:17:14,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:17:14,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14" (1/1) ... [2021-10-28 23:17:14,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14" (1/1) ... [2021-10-28 23:17:14,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14" (1/1) ... [2021-10-28 23:17:14,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14" (1/1) ... [2021-10-28 23:17:14,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14" (1/1) ... [2021-10-28 23:17:14,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14" (1/1) ... [2021-10-28 23:17:14,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14" (1/1) ... [2021-10-28 23:17:14,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:17:14,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:17:14,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:17:14,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:17:14,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14" (1/1) ... [2021-10-28 23:17:14,290 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:17:14,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:17:14,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:17:14,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-28 23:17:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:17:14,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:17:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:17:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:17:14,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:17:14,822 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-28 23:17:14,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:17:14 BoogieIcfgContainer [2021-10-28 23:17:14,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:17:14,826 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-28 23:17:14,839 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-28 23:17:14,843 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-28 23:17:14,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:17:14,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 11:17:13" (1/3) ... [2021-10-28 23:17:14,846 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7589aca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 11:17:14, skipping insertion in model container [2021-10-28 23:17:14,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:17:14,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:17:14" (2/3) ... [2021-10-28 23:17:14,847 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7589aca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 11:17:14, skipping insertion in model container [2021-10-28 23:17:14,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:17:14,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:17:14" (3/3) ... [2021-10-28 23:17:14,849 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2021-10-28 23:17:14,915 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-28 23:17:14,916 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-28 23:17:14,916 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-28 23:17:14,916 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-28 23:17:14,916 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-28 23:17:14,916 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-28 23:17:14,917 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-28 23:17:14,917 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-28 23:17:14,940 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 23:17:14,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-10-28 23:17:14,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:14,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:14,981 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:14,981 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, 1, 1] [2021-10-28 23:17:14,982 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-28 23:17:14,982 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 23:17:14,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-10-28 23:17:14,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:14,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:14,991 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:14,991 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, 1, 1] [2021-10-28 23:17:15,000 INFO L791 eck$LassoCheckResult]: Stem: 43#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; 22#L225-1true [2021-10-28 23:17:15,002 INFO L793 eck$LassoCheckResult]: Loop: 22#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; 27#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; 50#L105-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 45#L109-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L113-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 24#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; 40#L141-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 55#L145-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 48#L149-1true assume !(0 != main_~p1~0); 47#L155-1true assume 0 != main_~p2~0; 9#L161true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 20#L160true assume !(0 != main_~p3~0); 12#L165-1true assume !(0 != main_~p4~0); 42#L170-1true assume !(0 != main_~p5~0); 46#L175-1true assume !(0 != main_~p6~0); 19#L180-1true assume !(0 != main_~p7~0); 39#L185-1true assume !(0 != main_~p8~0); 26#L190-1true assume !(0 != main_~p9~0); 41#L195-1true assume !(0 != main_~p10~0); 16#L200-1true assume !(0 != main_~p11~0); 44#L205-1true assume !(0 != main_~p12~0); 25#L210-1true assume !(0 != main_~p13~0); 6#L215-1true assume 0 != main_~p14~0; 15#L221true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 54#L220true assume !(0 != main_~p15~0); 22#L225-1true [2021-10-28 23:17:15,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:15,009 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-28 23:17:15,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:15,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654958830] [2021-10-28 23:17:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:15,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:15,144 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:15,200 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash -638858682, now seen corresponding path program 1 times [2021-10-28 23:17:15,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:15,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465957467] [2021-10-28 23:17:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:15,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:17:15,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:15,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465957467] [2021-10-28 23:17:15,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465957467] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:15,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:15,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:17:15,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355810212] [2021-10-28 23:17:15,486 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:17:15,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:15,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:17:15,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:17:15,518 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 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:17:15,568 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2021-10-28 23:17:15,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:17:15,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2021-10-28 23:17:15,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-10-28 23:17:15,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 149 transitions. [2021-10-28 23:17:15,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2021-10-28 23:17:15,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2021-10-28 23:17:15,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 149 transitions. [2021-10-28 23:17:15,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:17:15,595 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-10-28 23:17:15,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 149 transitions. [2021-10-28 23:17:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-10-28 23:17:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2021-10-28 23:17:15,645 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-10-28 23:17:15,645 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-10-28 23:17:15,645 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-28 23:17:15,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 149 transitions. [2021-10-28 23:17:15,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-10-28 23:17:15,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:15,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:15,651 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:15,652 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, 1, 1] [2021-10-28 23:17:15,652 INFO L791 eck$LassoCheckResult]: Stem: 218#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); 212#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; 174#L225-1 [2021-10-28 23:17:15,652 INFO L793 eck$LassoCheckResult]: Loop: 174#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 210#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; 211#L93 assume !(0 != main_~p1~0); 206#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 186#L97-1 assume !(0 != main_~p3~0); 187#L101-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 191#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 220#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 182#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 183#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 201#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 192#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 193#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; 172#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 215#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 226#L149-1 assume !(0 != main_~p1~0); 227#L155-1 assume 0 != main_~p2~0; 262#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 261#L160 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); 216#L195-1 assume !(0 != main_~p10~0); 188#L200-1 assume !(0 != main_~p11~0); 189#L205-1 assume !(0 != main_~p12~0); 241#L210-1 assume !(0 != main_~p13~0); 239#L215-1 assume 0 != main_~p14~0; 184#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 185#L220 assume !(0 != main_~p15~0); 174#L225-1 [2021-10-28 23:17:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:15,654 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-28 23:17:15,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:15,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92533125] [2021-10-28 23:17:15,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:15,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:15,677 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:15,704 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:15,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:15,706 INFO L85 PathProgramCache]: Analyzing trace with hash -364099068, now seen corresponding path program 1 times [2021-10-28 23:17:15,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:15,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044570790] [2021-10-28 23:17:15,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:15,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:17:15,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:15,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044570790] [2021-10-28 23:17:15,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044570790] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:15,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:15,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:17:15,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352769622] [2021-10-28 23:17:15,831 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:17:15,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:15,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:17:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:17:15,841 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:17:15,896 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2021-10-28 23:17:15,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:17:15,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 290 transitions. [2021-10-28 23:17:15,905 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-10-28 23:17:15,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 290 transitions. [2021-10-28 23:17:15,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2021-10-28 23:17:15,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2021-10-28 23:17:15,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 290 transitions. [2021-10-28 23:17:15,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:17:15,916 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-10-28 23:17:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 290 transitions. [2021-10-28 23:17:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-10-28 23:17:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2021-10-28 23:17:15,945 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-10-28 23:17:15,945 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-10-28 23:17:15,945 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-28 23:17:15,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 290 transitions. [2021-10-28 23:17:15,956 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-10-28 23:17:15,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:15,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:15,959 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:15,959 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, 1, 1] [2021-10-28 23:17:15,960 INFO L791 eck$LassoCheckResult]: Stem: 503#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); 495#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; 496#L225-1 [2021-10-28 23:17:15,960 INFO L793 eck$LassoCheckResult]: Loop: 496#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 521#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; 518#L93 assume !(0 != main_~p1~0); 519#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 513#L97-1 assume !(0 != main_~p3~0); 514#L101-1 assume !(0 != main_~p4~0); 589#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 588#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 587#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 586#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 585#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 584#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 583#L129-1 assume !(0 != main_~p11~0); 582#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 581#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 580#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 579#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 578#L149-1 assume !(0 != main_~p1~0); 577#L155-1 assume 0 != main_~p2~0; 576#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 573#L160 assume !(0 != main_~p3~0); 569#L165-1 assume !(0 != main_~p4~0); 565#L170-1 assume !(0 != main_~p5~0); 562#L175-1 assume !(0 != main_~p6~0); 558#L180-1 assume !(0 != main_~p7~0); 553#L185-1 assume !(0 != main_~p8~0); 550#L190-1 assume !(0 != main_~p9~0); 546#L195-1 assume !(0 != main_~p10~0); 542#L200-1 assume !(0 != main_~p11~0); 538#L205-1 assume !(0 != main_~p12~0); 534#L210-1 assume !(0 != main_~p13~0); 530#L215-1 assume 0 != main_~p14~0; 528#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 526#L220 assume !(0 != main_~p15~0); 496#L225-1 [2021-10-28 23:17:15,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-28 23:17:15,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:15,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548848410] [2021-10-28 23:17:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:15,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:15,994 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:16,036 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:16,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:16,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1022104326, now seen corresponding path program 1 times [2021-10-28 23:17:16,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:16,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260170527] [2021-10-28 23:17:16,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:16,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:17:16,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:16,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260170527] [2021-10-28 23:17:16,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260170527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:16,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:16,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:17:16,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109370046] [2021-10-28 23:17:16,092 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:17:16,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:16,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:17:16,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:17:16,094 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:17:16,125 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2021-10-28 23:17:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:17:16,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 566 transitions. [2021-10-28 23:17:16,131 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-10-28 23:17:16,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 566 transitions. [2021-10-28 23:17:16,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2021-10-28 23:17:16,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2021-10-28 23:17:16,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 566 transitions. [2021-10-28 23:17:16,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:17:16,159 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-10-28 23:17:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 566 transitions. [2021-10-28 23:17:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-10-28 23:17:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 566 transitions. [2021-10-28 23:17:16,192 INFO L704 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-10-28 23:17:16,192 INFO L587 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-10-28 23:17:16,192 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-28 23:17:16,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 566 transitions. [2021-10-28 23:17:16,196 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-10-28 23:17:16,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:16,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:16,198 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:16,198 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, 1, 1] [2021-10-28 23:17:16,198 INFO L791 eck$LassoCheckResult]: Stem: 1060#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); 1053#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; 1054#L225-1 [2021-10-28 23:17:16,199 INFO L793 eck$LassoCheckResult]: Loop: 1054#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 1078#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; 1079#L93 assume !(0 != main_~p1~0); 1205#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1223#L97-1 assume !(0 != main_~p3~0); 1220#L101-1 assume !(0 != main_~p4~0); 1217#L105-1 assume !(0 != main_~p5~0); 1215#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1214#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1212#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1210#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1208#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1206#L129-1 assume !(0 != main_~p11~0); 1203#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1200#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1197#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1193#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1167#L149-1 assume !(0 != main_~p1~0); 1165#L155-1 assume 0 != main_~p2~0; 1162#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1160#L160 assume !(0 != main_~p3~0); 1156#L165-1 assume !(0 != main_~p4~0); 1153#L170-1 assume !(0 != main_~p5~0); 1132#L175-1 assume !(0 != main_~p6~0); 1128#L180-1 assume !(0 != main_~p7~0); 1122#L185-1 assume !(0 != main_~p8~0); 1118#L190-1 assume !(0 != main_~p9~0); 1117#L195-1 assume !(0 != main_~p10~0); 1241#L200-1 assume !(0 != main_~p11~0); 1103#L205-1 assume !(0 != main_~p12~0); 1102#L210-1 assume !(0 != main_~p13~0); 1091#L215-1 assume 0 != main_~p14~0; 1092#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 1086#L220 assume !(0 != main_~p15~0); 1054#L225-1 [2021-10-28 23:17:16,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:16,200 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-28 23:17:16,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:16,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517481687] [2021-10-28 23:17:16,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:16,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:16,216 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:16,232 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:16,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash 512631236, now seen corresponding path program 1 times [2021-10-28 23:17:16,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:16,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662635318] [2021-10-28 23:17:16,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:16,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:17:16,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:16,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662635318] [2021-10-28 23:17:16,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662635318] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:16,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:16,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:17:16,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657265713] [2021-10-28 23:17:16,280 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:17:16,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:16,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:17:16,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:17:16,281 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:17:16,328 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2021-10-28 23:17:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:17:16,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1106 transitions. [2021-10-28 23:17:16,340 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-10-28 23:17:16,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1106 transitions. [2021-10-28 23:17:16,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2021-10-28 23:17:16,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2021-10-28 23:17:16,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1106 transitions. [2021-10-28 23:17:16,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:17:16,356 INFO L681 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-10-28 23:17:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1106 transitions. [2021-10-28 23:17:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2021-10-28 23:17:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1106 transitions. [2021-10-28 23:17:16,405 INFO L704 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-10-28 23:17:16,406 INFO L587 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-10-28 23:17:16,406 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-28 23:17:16,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1106 transitions. [2021-10-28 23:17:16,413 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-10-28 23:17:16,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:16,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:16,415 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:16,415 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, 1, 1] [2021-10-28 23:17:16,416 INFO L791 eck$LassoCheckResult]: Stem: 2165#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); 2154#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; 2155#L225-1 [2021-10-28 23:17:16,416 INFO L793 eck$LassoCheckResult]: Loop: 2155#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 2351#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; 2348#L93 assume !(0 != main_~p1~0); 2349#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2338#L97-1 assume !(0 != main_~p3~0); 2339#L101-1 assume !(0 != main_~p4~0); 2327#L105-1 assume !(0 != main_~p5~0); 2329#L109-1 assume !(0 != main_~p6~0); 2315#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2316#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2303#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2304#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2291#L129-1 assume !(0 != main_~p11~0); 2292#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2279#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2280#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2267#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2268#L149-1 assume !(0 != main_~p1~0); 2399#L155-1 assume 0 != main_~p2~0; 2398#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2397#L160 assume !(0 != main_~p3~0); 2393#L165-1 assume !(0 != main_~p4~0); 2391#L170-1 assume !(0 != main_~p5~0); 2389#L175-1 assume !(0 != main_~p6~0); 2386#L180-1 assume !(0 != main_~p7~0); 2381#L185-1 assume !(0 != main_~p8~0); 2378#L190-1 assume !(0 != main_~p9~0); 2374#L195-1 assume !(0 != main_~p10~0); 2370#L200-1 assume !(0 != main_~p11~0); 2366#L205-1 assume !(0 != main_~p12~0); 2362#L210-1 assume !(0 != main_~p13~0); 2359#L215-1 assume 0 != main_~p14~0; 2357#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 2356#L220 assume !(0 != main_~p15~0); 2155#L225-1 [2021-10-28 23:17:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:16,419 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-10-28 23:17:16,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:16,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025970715] [2021-10-28 23:17:16,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:16,420 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:16,440 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:16,465 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:16,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:16,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1859108026, now seen corresponding path program 1 times [2021-10-28 23:17:16,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:16,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140863755] [2021-10-28 23:17:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:16,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:17:16,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:16,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140863755] [2021-10-28 23:17:16,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140863755] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:16,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:16,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:17:16,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829842147] [2021-10-28 23:17:16,548 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:17:16,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:16,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:17:16,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:17:16,553 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:17:16,584 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2021-10-28 23:17:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:17:16,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2162 transitions. [2021-10-28 23:17:16,605 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-10-28 23:17:16,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2162 transitions. [2021-10-28 23:17:16,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2021-10-28 23:17:16,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2021-10-28 23:17:16,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2162 transitions. [2021-10-28 23:17:16,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:17:16,630 INFO L681 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-10-28 23:17:16,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2162 transitions. [2021-10-28 23:17:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2021-10-28 23:17:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2162 transitions. [2021-10-28 23:17:16,712 INFO L704 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-10-28 23:17:16,712 INFO L587 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-10-28 23:17:16,712 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-28 23:17:16,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2162 transitions. [2021-10-28 23:17:16,726 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-10-28 23:17:16,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:16,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:16,728 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:16,729 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, 1, 1] [2021-10-28 23:17:16,729 INFO L791 eck$LassoCheckResult]: Stem: 4312#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); 4301#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; 4302#L225-1 [2021-10-28 23:17:16,729 INFO L793 eck$LassoCheckResult]: Loop: 4302#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 4635#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; 4632#L93 assume !(0 != main_~p1~0); 4595#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4352#L97-1 assume !(0 != main_~p3~0); 4353#L101-1 assume !(0 != main_~p4~0); 4588#L105-1 assume !(0 != main_~p5~0); 4586#L109-1 assume !(0 != main_~p6~0); 4580#L113-1 assume !(0 != main_~p7~0); 4576#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4572#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4569#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4566#L129-1 assume !(0 != main_~p11~0); 4563#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4559#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4556#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4553#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4548#L149-1 assume !(0 != main_~p1~0); 4546#L155-1 assume 0 != main_~p2~0; 4543#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4540#L160 assume !(0 != main_~p3~0); 4535#L165-1 assume !(0 != main_~p4~0); 4536#L170-1 assume !(0 != main_~p5~0); 4686#L175-1 assume !(0 != main_~p6~0); 4682#L180-1 assume !(0 != main_~p7~0); 4678#L185-1 assume !(0 != main_~p8~0); 4674#L190-1 assume !(0 != main_~p9~0); 4668#L195-1 assume !(0 != main_~p10~0); 4663#L200-1 assume !(0 != main_~p11~0); 4658#L205-1 assume !(0 != main_~p12~0); 4653#L210-1 assume !(0 != main_~p13~0); 4648#L215-1 assume 0 != main_~p14~0; 4645#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 4642#L220 assume !(0 != main_~p15~0); 4302#L225-1 [2021-10-28 23:17:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:16,733 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-10-28 23:17:16,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:16,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097718680] [2021-10-28 23:17:16,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:16,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:16,759 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:16,787 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:16,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:16,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1797068412, now seen corresponding path program 1 times [2021-10-28 23:17:16,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:16,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478567017] [2021-10-28 23:17:16,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:16,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:17:16,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:16,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478567017] [2021-10-28 23:17:16,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478567017] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:16,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:16,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:17:16,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442063683] [2021-10-28 23:17:16,854 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:17:16,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:16,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:17:16,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:17:16,856 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:17:16,898 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2021-10-28 23:17:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:17:16,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4226 transitions. [2021-10-28 23:17:16,945 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-10-28 23:17:16,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4226 transitions. [2021-10-28 23:17:16,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2021-10-28 23:17:16,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2021-10-28 23:17:16,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4226 transitions. [2021-10-28 23:17:16,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:17:16,990 INFO L681 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-10-28 23:17:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4226 transitions. [2021-10-28 23:17:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2021-10-28 23:17:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4226 transitions. [2021-10-28 23:17:17,093 INFO L704 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-10-28 23:17:17,093 INFO L587 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-10-28 23:17:17,093 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-28 23:17:17,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4226 transitions. [2021-10-28 23:17:17,121 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-10-28 23:17:17,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:17,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:17,125 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:17,126 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, 1, 1] [2021-10-28 23:17:17,126 INFO L791 eck$LassoCheckResult]: Stem: 8565#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); 8557#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; 8558#L225-1 [2021-10-28 23:17:17,127 INFO L793 eck$LassoCheckResult]: Loop: 8558#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 8705#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; 8706#L93 assume !(0 != main_~p1~0); 8830#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8829#L97-1 assume !(0 != main_~p3~0); 8827#L101-1 assume !(0 != main_~p4~0); 8824#L105-1 assume !(0 != main_~p5~0); 8820#L109-1 assume !(0 != main_~p6~0); 8816#L113-1 assume !(0 != main_~p7~0); 8812#L117-1 assume !(0 != main_~p8~0); 8810#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8808#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8806#L129-1 assume !(0 != main_~p11~0); 8804#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8802#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8800#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8798#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8795#L149-1 assume !(0 != main_~p1~0); 8796#L155-1 assume 0 != main_~p2~0; 8785#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8786#L160 assume !(0 != main_~p3~0); 8777#L165-1 assume !(0 != main_~p4~0); 8778#L170-1 assume !(0 != main_~p5~0); 8766#L175-1 assume !(0 != main_~p6~0); 8768#L180-1 assume !(0 != main_~p7~0); 8756#L185-1 assume !(0 != main_~p8~0); 8757#L190-1 assume !(0 != main_~p9~0); 8747#L195-1 assume !(0 != main_~p10~0); 8746#L200-1 assume !(0 != main_~p11~0); 8735#L205-1 assume !(0 != main_~p12~0); 8734#L210-1 assume !(0 != main_~p13~0); 8722#L215-1 assume 0 != main_~p14~0; 8723#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 8715#L220 assume !(0 != main_~p15~0); 8558#L225-1 [2021-10-28 23:17:17,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-10-28 23:17:17,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:17,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061643109] [2021-10-28 23:17:17,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:17,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:17,158 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:17,182 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:17,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:17,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1656519802, now seen corresponding path program 1 times [2021-10-28 23:17:17,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:17,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357757812] [2021-10-28 23:17:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:17,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:17:17,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:17,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357757812] [2021-10-28 23:17:17,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357757812] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:17,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:17,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:17:17,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436056455] [2021-10-28 23:17:17,252 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:17:17,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:17:17,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:17:17,253 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:17:17,353 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2021-10-28 23:17:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:17:17,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8258 transitions. [2021-10-28 23:17:17,425 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-10-28 23:17:17,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8258 transitions. [2021-10-28 23:17:17,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2021-10-28 23:17:17,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2021-10-28 23:17:17,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8258 transitions. [2021-10-28 23:17:17,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:17:17,512 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-10-28 23:17:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8258 transitions. [2021-10-28 23:17:17,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2021-10-28 23:17:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8258 transitions. [2021-10-28 23:17:17,737 INFO L704 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-10-28 23:17:17,738 INFO L587 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-10-28 23:17:17,738 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-28 23:17:17,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8258 transitions. [2021-10-28 23:17:17,820 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-10-28 23:17:17,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:17,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:17,823 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:17,823 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, 1, 1] [2021-10-28 23:17:17,824 INFO L791 eck$LassoCheckResult]: Stem: 16967#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); 16953#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; 16954#L225-1 [2021-10-28 23:17:17,826 INFO L793 eck$LassoCheckResult]: Loop: 16954#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 17157#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; 17155#L93 assume !(0 != main_~p1~0); 17151#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 17147#L97-1 assume !(0 != main_~p3~0); 17140#L101-1 assume !(0 != main_~p4~0); 17132#L105-1 assume !(0 != main_~p5~0); 17127#L109-1 assume !(0 != main_~p6~0); 17120#L113-1 assume !(0 != main_~p7~0); 17112#L117-1 assume !(0 != main_~p8~0); 17104#L121-1 assume !(0 != main_~p9~0); 17099#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 17095#L129-1 assume !(0 != main_~p11~0); 17091#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 17087#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 17083#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 17079#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 17073#L149-1 assume !(0 != main_~p1~0); 17074#L155-1 assume 0 != main_~p2~0; 17211#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 17206#L160 assume !(0 != main_~p3~0); 17201#L165-1 assume !(0 != main_~p4~0); 17197#L170-1 assume !(0 != main_~p5~0); 17193#L175-1 assume !(0 != main_~p6~0); 17191#L180-1 assume !(0 != main_~p7~0); 17189#L185-1 assume !(0 != main_~p8~0); 17185#L190-1 assume !(0 != main_~p9~0); 17182#L195-1 assume !(0 != main_~p10~0); 17178#L200-1 assume !(0 != main_~p11~0); 17174#L205-1 assume !(0 != main_~p12~0); 17170#L210-1 assume !(0 != main_~p13~0); 17166#L215-1 assume 0 != main_~p14~0; 17164#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 17162#L220 assume !(0 != main_~p15~0); 16954#L225-1 [2021-10-28 23:17:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-10-28 23:17:17,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:17,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094277612] [2021-10-28 23:17:17,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:17,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:17,852 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:17,880 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:17,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:17,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1790533308, now seen corresponding path program 1 times [2021-10-28 23:17:17,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:17,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338747691] [2021-10-28 23:17:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:17,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:17:17,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:17,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338747691] [2021-10-28 23:17:17,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338747691] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:17,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:17,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:17:17,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882025992] [2021-10-28 23:17:17,955 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:17:17,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:17,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:17:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:17:17,958 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:17:18,056 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2021-10-28 23:17:18,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:17:18,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16130 transitions. [2021-10-28 23:17:18,164 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-10-28 23:17:18,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16130 transitions. [2021-10-28 23:17:18,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2021-10-28 23:17:18,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2021-10-28 23:17:18,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16130 transitions. [2021-10-28 23:17:18,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:17:18,314 INFO L681 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-10-28 23:17:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16130 transitions. [2021-10-28 23:17:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2021-10-28 23:17:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16130 transitions. [2021-10-28 23:17:18,793 INFO L704 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-10-28 23:17:18,793 INFO L587 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-10-28 23:17:18,793 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-28 23:17:18,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16130 transitions. [2021-10-28 23:17:18,845 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-10-28 23:17:18,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:18,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:18,846 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:18,846 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, 1, 1] [2021-10-28 23:17:18,847 INFO L791 eck$LassoCheckResult]: Stem: 33550#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); 33536#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; 33537#L225-1 [2021-10-28 23:17:18,847 INFO L793 eck$LassoCheckResult]: Loop: 33537#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 33841#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; 33839#L93 assume !(0 != main_~p1~0); 33838#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 33837#L97-1 assume !(0 != main_~p3~0); 33835#L101-1 assume !(0 != main_~p4~0); 33833#L105-1 assume !(0 != main_~p5~0); 33831#L109-1 assume !(0 != main_~p6~0); 33830#L113-1 assume !(0 != main_~p7~0); 33828#L117-1 assume !(0 != main_~p8~0); 33824#L121-1 assume !(0 != main_~p9~0); 33821#L125-1 assume !(0 != main_~p10~0); 33815#L129-1 assume !(0 != main_~p11~0); 33816#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 33807#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 33808#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 33799#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 33800#L149-1 assume !(0 != main_~p1~0); 33789#L155-1 assume 0 != main_~p2~0; 33790#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 33781#L160 assume !(0 != main_~p3~0); 33780#L165-1 assume !(0 != main_~p4~0); 33720#L170-1 assume !(0 != main_~p5~0); 33721#L175-1 assume !(0 != main_~p6~0); 33711#L180-1 assume !(0 != main_~p7~0); 33712#L185-1 assume !(0 != main_~p8~0); 33699#L190-1 assume !(0 != main_~p9~0); 33701#L195-1 assume !(0 != main_~p10~0); 33851#L200-1 assume !(0 != main_~p11~0); 33849#L205-1 assume !(0 != main_~p12~0); 33847#L210-1 assume !(0 != main_~p13~0); 33845#L215-1 assume 0 != main_~p14~0; 33844#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 33843#L220 assume !(0 != main_~p15~0); 33537#L225-1 [2021-10-28 23:17:18,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:18,848 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-10-28 23:17:18,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:18,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669050217] [2021-10-28 23:17:18,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:18,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:18,865 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:18,880 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash 698995654, now seen corresponding path program 1 times [2021-10-28 23:17:18,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:18,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123888868] [2021-10-28 23:17:18,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:18,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:17:18,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:18,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123888868] [2021-10-28 23:17:18,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123888868] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:18,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:18,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:17:18,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053488858] [2021-10-28 23:17:18,930 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:17:18,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:18,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:17:18,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:17:18,933 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:17:19,188 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2021-10-28 23:17:19,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:17:19,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 31490 transitions. [2021-10-28 23:17:19,458 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-10-28 23:17:19,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 31490 transitions. [2021-10-28 23:17:19,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2021-10-28 23:17:19,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2021-10-28 23:17:19,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 31490 transitions. [2021-10-28 23:17:19,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:17:19,750 INFO L681 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-10-28 23:17:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 31490 transitions. [2021-10-28 23:17:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2021-10-28 23:17:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 31490 transitions. [2021-10-28 23:17:20,536 INFO L704 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-10-28 23:17:20,536 INFO L587 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-10-28 23:17:20,536 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-28 23:17:20,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 31490 transitions. [2021-10-28 23:17:20,615 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-10-28 23:17:20,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:20,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:20,617 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:20,618 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, 1, 1] [2021-10-28 23:17:20,618 INFO L791 eck$LassoCheckResult]: Stem: 66321#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); 66308#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; 66309#L225-1 [2021-10-28 23:17:20,618 INFO L793 eck$LassoCheckResult]: Loop: 66309#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 66490#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; 66486#L93 assume !(0 != main_~p1~0); 66484#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 66482#L97-1 assume !(0 != main_~p3~0); 66478#L101-1 assume !(0 != main_~p4~0); 66474#L105-1 assume !(0 != main_~p5~0); 66472#L109-1 assume !(0 != main_~p6~0); 66468#L113-1 assume !(0 != main_~p7~0); 66464#L117-1 assume !(0 != main_~p8~0); 66460#L121-1 assume !(0 != main_~p9~0); 66456#L125-1 assume !(0 != main_~p10~0); 66454#L129-1 assume !(0 != main_~p11~0); 66450#L133-1 assume !(0 != main_~p12~0); 66448#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 66446#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 66444#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 66440#L149-1 assume !(0 != main_~p1~0); 66438#L155-1 assume 0 != main_~p2~0; 66436#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 66433#L160 assume !(0 != main_~p3~0); 66428#L165-1 assume !(0 != main_~p4~0); 66424#L170-1 assume !(0 != main_~p5~0); 66421#L175-1 assume !(0 != main_~p6~0); 66422#L180-1 assume !(0 != main_~p7~0); 66521#L185-1 assume !(0 != main_~p8~0); 66517#L190-1 assume !(0 != main_~p9~0); 66513#L195-1 assume !(0 != main_~p10~0); 66510#L200-1 assume !(0 != main_~p11~0); 66505#L205-1 assume !(0 != main_~p12~0); 66502#L210-1 assume !(0 != main_~p13~0); 66499#L215-1 assume 0 != main_~p14~0; 66497#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 66494#L220 assume !(0 != main_~p15~0); 66309#L225-1 [2021-10-28 23:17:20,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-10-28 23:17:20,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:20,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303776642] [2021-10-28 23:17:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:20,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:20,630 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:20,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:20,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1121697480, now seen corresponding path program 1 times [2021-10-28 23:17:20,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:20,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522044440] [2021-10-28 23:17:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:20,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:17:20,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:20,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522044440] [2021-10-28 23:17:20,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522044440] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:20,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:20,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:17:20,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587686118] [2021-10-28 23:17:20,669 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:17:20,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:20,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:17:20,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:17:20,671 INFO L87 Difference]: Start difference. First operand 21762 states and 31490 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:17:21,005 INFO L93 Difference]: Finished difference Result 43010 states and 61442 transitions. [2021-10-28 23:17:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:17:21,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 61442 transitions. [2021-10-28 23:17:21,366 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-10-28 23:17:21,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 61442 transitions. [2021-10-28 23:17:21,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2021-10-28 23:17:21,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2021-10-28 23:17:21,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 61442 transitions. [2021-10-28 23:17:21,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:17:21,706 INFO L681 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-10-28 23:17:21,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 61442 transitions. [2021-10-28 23:17:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2021-10-28 23:17:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4285514996512438) internal successors, (61442), 43009 states have internal predecessors, (61442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 61442 transitions. [2021-10-28 23:17:23,011 INFO L704 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-10-28 23:17:23,012 INFO L587 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-10-28 23:17:23,012 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-28 23:17:23,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 61442 transitions. [2021-10-28 23:17:23,262 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-10-28 23:17:23,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:23,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:23,264 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:23,264 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, 1, 1] [2021-10-28 23:17:23,265 INFO L791 eck$LassoCheckResult]: Stem: 131107#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); 131095#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; 131096#L225-1 [2021-10-28 23:17:23,267 INFO L793 eck$LassoCheckResult]: Loop: 131096#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 132419#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; 132416#L93 assume !(0 != main_~p1~0); 132413#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 132411#L97-1 assume !(0 != main_~p3~0); 132408#L101-1 assume !(0 != main_~p4~0); 132404#L105-1 assume !(0 != main_~p5~0); 132400#L109-1 assume !(0 != main_~p6~0); 132396#L113-1 assume !(0 != main_~p7~0); 132392#L117-1 assume !(0 != main_~p8~0); 132388#L121-1 assume !(0 != main_~p9~0); 132384#L125-1 assume !(0 != main_~p10~0); 132381#L129-1 assume !(0 != main_~p11~0); 132378#L133-1 assume !(0 != main_~p12~0); 132379#L137-1 assume !(0 != main_~p13~0); 132483#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 132481#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 132476#L149-1 assume !(0 != main_~p1~0); 132474#L155-1 assume 0 != main_~p2~0; 132472#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 132304#L160 assume !(0 != main_~p3~0); 132303#L165-1 assume !(0 != main_~p4~0); 132269#L170-1 assume !(0 != main_~p5~0); 132270#L175-1 assume !(0 != main_~p6~0); 132246#L180-1 assume !(0 != main_~p7~0); 132247#L185-1 assume !(0 != main_~p8~0); 132158#L190-1 assume !(0 != main_~p9~0); 132160#L195-1 assume !(0 != main_~p10~0); 132436#L200-1 assume !(0 != main_~p11~0); 132431#L205-1 assume !(0 != main_~p12~0); 132429#L210-1 assume !(0 != main_~p13~0); 132428#L215-1 assume 0 != main_~p14~0; 132426#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 132424#L220 assume !(0 != main_~p15~0); 131096#L225-1 [2021-10-28 23:17:23,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-10-28 23:17:23,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:23,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469290107] [2021-10-28 23:17:23,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:23,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:23,278 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:23,311 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:23,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash 304049030, now seen corresponding path program 1 times [2021-10-28 23:17:23,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:23,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360798206] [2021-10-28 23:17:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:23,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:17:23,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:23,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360798206] [2021-10-28 23:17:23,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360798206] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:23,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:23,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 23:17:23,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376503432] [2021-10-28 23:17:23,356 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 23:17:23,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:23,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:17:23,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:17:23,357 INFO L87 Difference]: Start difference. First operand 43010 states and 61442 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:23,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:17:23,828 INFO L93 Difference]: Finished difference Result 84994 states and 119810 transitions. [2021-10-28 23:17:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:17:23,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 119810 transitions. [2021-10-28 23:17:24,661 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-10-28 23:17:24,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 119810 transitions. [2021-10-28 23:17:24,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2021-10-28 23:17:25,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2021-10-28 23:17:25,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 119810 transitions. [2021-10-28 23:17:25,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:17:25,111 INFO L681 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-10-28 23:17:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 119810 transitions. [2021-10-28 23:17:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2021-10-28 23:17:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.409628914982234) internal successors, (119810), 84993 states have internal predecessors, (119810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:17:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 119810 transitions. [2021-10-28 23:17:27,377 INFO L704 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-10-28 23:17:27,379 INFO L587 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-10-28 23:17:27,380 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-10-28 23:17:27,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 119810 transitions. [2021-10-28 23:17:27,649 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-10-28 23:17:27,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:17:27,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:17:27,651 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 23:17:27,651 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, 1, 1] [2021-10-28 23:17:27,651 INFO L791 eck$LassoCheckResult]: Stem: 259110#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); 259098#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; 259099#L225-1 [2021-10-28 23:17:27,651 INFO L793 eck$LassoCheckResult]: Loop: 259099#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 260713#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; 260700#L93 assume !(0 != main_~p1~0); 260702#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 260686#L97-1 assume !(0 != main_~p3~0); 260687#L101-1 assume !(0 != main_~p4~0); 260670#L105-1 assume !(0 != main_~p5~0); 260672#L109-1 assume !(0 != main_~p6~0); 260644#L113-1 assume !(0 != main_~p7~0); 260646#L117-1 assume !(0 != main_~p8~0); 260618#L121-1 assume !(0 != main_~p9~0); 260620#L125-1 assume !(0 != main_~p10~0); 260839#L129-1 assume !(0 != main_~p11~0); 260837#L133-1 assume !(0 != main_~p12~0); 260833#L137-1 assume !(0 != main_~p13~0); 260830#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 260827#L145-1 assume !(0 != main_~p15~0); 260824#L149-1 assume !(0 != main_~p1~0); 260821#L155-1 assume 0 != main_~p2~0; 260818#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 260796#L160 assume !(0 != main_~p3~0); 260787#L165-1 assume !(0 != main_~p4~0); 260779#L170-1 assume !(0 != main_~p5~0); 260771#L175-1 assume !(0 != main_~p6~0); 260765#L180-1 assume !(0 != main_~p7~0); 260761#L185-1 assume !(0 != main_~p8~0); 260758#L190-1 assume !(0 != main_~p9~0); 260756#L195-1 assume !(0 != main_~p10~0); 260753#L200-1 assume !(0 != main_~p11~0); 260730#L205-1 assume !(0 != main_~p12~0); 260732#L210-1 assume !(0 != main_~p13~0); 260746#L215-1 assume 0 != main_~p14~0; 260738#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 260739#L220 assume !(0 != main_~p15~0); 259099#L225-1 [2021-10-28 23:17:27,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-10-28 23:17:27,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:27,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304407711] [2021-10-28 23:17:27,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:27,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:27,661 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:27,671 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:27,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1690095676, now seen corresponding path program 1 times [2021-10-28 23:17:27,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:27,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719445877] [2021-10-28 23:17:27,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:27,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:27,690 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:27,707 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:27,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:17:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash 365150982, now seen corresponding path program 1 times [2021-10-28 23:17:27,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:17:27,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660864105] [2021-10-28 23:17:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:17:27,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:17:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:27,721 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:17:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:17:27,745 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:17:28,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.10 11:17:28 BoogieIcfgContainer [2021-10-28 23:17:28,928 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-28 23:17:28,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:17:28,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:17:28,929 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:17:28,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:17:14" (3/4) ... [2021-10-28 23:17:28,933 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-28 23:17:28,993 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:17:28,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:17:28,996 INFO L168 Benchmark]: Toolchain (without parser) took 15224.44 ms. Allocated memory was 98.6 MB in the beginning and 6.5 GB in the end (delta: 6.4 GB). Free memory was 63.5 MB in the beginning and 5.7 GB in the end (delta: -5.6 GB). Peak memory consumption was 743.9 MB. Max. memory is 16.1 GB. [2021-10-28 23:17:28,997 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 98.6 MB. Free memory was 80.0 MB in the beginning and 79.9 MB in the end (delta: 74.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:17:28,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.10 ms. Allocated memory is still 98.6 MB. Free memory was 63.3 MB in the beginning and 75.1 MB in the end (delta: -11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:17:28,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.03 ms. Allocated memory is still 98.6 MB. Free memory was 75.1 MB in the beginning and 73.3 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:17:28,999 INFO L168 Benchmark]: Boogie Preprocessor took 36.90 ms. Allocated memory is still 98.6 MB. Free memory was 73.3 MB in the beginning and 71.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:17:28,999 INFO L168 Benchmark]: RCFGBuilder took 561.07 ms. Allocated memory is still 98.6 MB. Free memory was 71.9 MB in the beginning and 58.3 MB in the end (delta: 13.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-28 23:17:29,000 INFO L168 Benchmark]: BuchiAutomizer took 14101.97 ms. Allocated memory was 98.6 MB in the beginning and 6.5 GB in the end (delta: 6.4 GB). Free memory was 58.3 MB in the beginning and 5.7 GB in the end (delta: -5.6 GB). Peak memory consumption was 737.8 MB. Max. memory is 16.1 GB. [2021-10-28 23:17:29,001 INFO L168 Benchmark]: Witness Printer took 65.13 ms. Allocated memory is still 6.5 GB. Free memory was 5.7 GB in the beginning and 5.7 GB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:17:29,004 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.40 ms. Allocated memory is still 98.6 MB. Free memory was 80.0 MB in the beginning and 79.9 MB in the end (delta: 74.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 400.10 ms. Allocated memory is still 98.6 MB. Free memory was 63.3 MB in the beginning and 75.1 MB in the end (delta: -11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.03 ms. Allocated memory is still 98.6 MB. Free memory was 75.1 MB in the beginning and 73.3 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.90 ms. Allocated memory is still 98.6 MB. Free memory was 73.3 MB in the beginning and 71.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 561.07 ms. Allocated memory is still 98.6 MB. Free memory was 71.9 MB in the beginning and 58.3 MB in the end (delta: 13.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 14101.97 ms. Allocated memory was 98.6 MB in the beginning and 6.5 GB in the end (delta: 6.4 GB). Free memory was 58.3 MB in the beginning and 5.7 GB in the end (delta: -5.6 GB). Peak memory consumption was 737.8 MB. Max. memory is 16.1 GB. * Witness Printer took 65.13 ms. Allocated memory is still 6.5 GB. Free memory was 5.7 GB in the beginning and 5.7 GB in the end (delta: 3.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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 84994 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.0s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 5.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 2.7s Buchi closure took 0.1s. Biggest automaton had 84994 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1271 SDtfs, 648 SDslu, 801 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI11 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=9133} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=9133, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@663dd366=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8d85d3b=0, p14=11, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7cbe3ce7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4689ac54=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b92c3d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51b7e7e0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@102a331d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f98b2a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@77b6e8d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dcd5298=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=9135, \result=0, p2=13, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76831113=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2647d5a8=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39aacef0=0, lk13=0, p15=0, lk15=0, p13=0, p11=0, lk11=0, cond=10, NULL=9134, NULL=0, NULL=9136, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ce3b035=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57835cf1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18945af8=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 TRUE p2 != 0 [L98] lk2 = 1 [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 TRUE p14 != 0 [L146] lk14 = 1 [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND TRUE p2 != 0 [L161] COND FALSE !(lk2 != 1) [L162] lk2 = 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 TRUE p14 != 0 [L221] COND FALSE !(lk14 != 1) [L222] lk14 = 0 [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-28 23:17:29,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fc3c1c-0dcb-4102-9598-fa9f7166bbdf/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...