./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 15:15:05,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 15:15:05,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 15:15:05,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 15:15:05,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 15:15:05,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 15:15:05,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 15:15:05,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 15:15:05,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 15:15:05,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 15:15:05,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 15:15:05,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 15:15:05,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 15:15:05,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 15:15:05,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 15:15:05,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 15:15:05,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 15:15:05,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 15:15:05,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 15:15:05,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 15:15:05,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 15:15:05,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 15:15:05,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 15:15:05,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 15:15:05,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 15:15:05,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 15:15:05,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 15:15:05,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 15:15:05,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 15:15:05,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 15:15:05,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 15:15:05,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 15:15:05,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 15:15:05,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 15:15:05,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 15:15:05,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 15:15:05,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 15:15:05,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 15:15:05,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 15:15:05,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 15:15:05,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 15:15:05,216 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-22 15:15:05,284 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 15:15:05,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 15:15:05,284 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 15:15:05,284 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 15:15:05,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 15:15:05,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 15:15:05,286 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 15:15:05,287 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-22 15:15:05,287 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-22 15:15:05,287 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-22 15:15:05,287 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-22 15:15:05,288 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-22 15:15:05,288 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-22 15:15:05,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 15:15:05,289 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 15:15:05,289 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-22 15:15:05,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 15:15:05,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 15:15:05,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 15:15:05,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-22 15:15:05,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-22 15:15:05,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-22 15:15:05,290 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 15:15:05,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 15:15:05,295 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-22 15:15:05,295 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 15:15:05,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-22 15:15:05,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 15:15:05,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 15:15:05,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 15:15:05,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 15:15:05,297 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 15:15:05,299 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-22 15:15:05,299 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_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/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_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2021-11-22 15:15:05,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 15:15:05,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 15:15:05,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 15:15:05,754 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 15:15:05,756 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 15:15:05,757 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/locks/test_locks_15-2.c [2021-11-22 15:15:05,832 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/data/f70896faa/2110eaaf69db40a0863d7458a023458d/FLAGa639f1b78 [2021-11-22 15:15:06,444 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 15:15:06,445 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/sv-benchmarks/c/locks/test_locks_15-2.c [2021-11-22 15:15:06,472 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/data/f70896faa/2110eaaf69db40a0863d7458a023458d/FLAGa639f1b78 [2021-11-22 15:15:06,758 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/data/f70896faa/2110eaaf69db40a0863d7458a023458d [2021-11-22 15:15:06,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 15:15:06,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 15:15:06,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 15:15:06,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 15:15:06,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 15:15:06,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 03:15:06" (1/1) ... [2021-11-22 15:15:06,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cfd6b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:06, skipping insertion in model container [2021-11-22 15:15:06,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 03:15:06" (1/1) ... [2021-11-22 15:15:06,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 15:15:06,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 15:15:07,084 WARN L230 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_b2ac184e-104c-482e-9bcd-97202eaee75c/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2021-11-22 15:15:07,087 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 15:15:07,098 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 15:15:07,144 WARN L230 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_b2ac184e-104c-482e-9bcd-97202eaee75c/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2021-11-22 15:15:07,146 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 15:15:07,168 INFO L208 MainTranslator]: Completed translation [2021-11-22 15:15:07,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07 WrapperNode [2021-11-22 15:15:07,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 15:15:07,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 15:15:07,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 15:15:07,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 15:15:07,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07" (1/1) ... [2021-11-22 15:15:07,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07" (1/1) ... [2021-11-22 15:15:07,256 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 177 [2021-11-22 15:15:07,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 15:15:07,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 15:15:07,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 15:15:07,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 15:15:07,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07" (1/1) ... [2021-11-22 15:15:07,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07" (1/1) ... [2021-11-22 15:15:07,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07" (1/1) ... [2021-11-22 15:15:07,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07" (1/1) ... [2021-11-22 15:15:07,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07" (1/1) ... [2021-11-22 15:15:07,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07" (1/1) ... [2021-11-22 15:15:07,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07" (1/1) ... [2021-11-22 15:15:07,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 15:15:07,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 15:15:07,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 15:15:07,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 15:15:07,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07" (1/1) ... [2021-11-22 15:15:07,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-22 15:15:07,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:15:07,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-22 15:15:07,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-22 15:15:07,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 15:15:07,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 15:15:07,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 15:15:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 15:15:07,519 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 15:15:07,522 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 15:15:07,820 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 15:15:07,829 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 15:15:07,830 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 15:15:07,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:15:07 BoogieIcfgContainer [2021-11-22 15:15:07,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 15:15:07,834 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-22 15:15:07,835 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-22 15:15:07,839 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-22 15:15:07,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-22 15:15:07,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 03:15:06" (1/3) ... [2021-11-22 15:15:07,842 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a39a6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 03:15:07, skipping insertion in model container [2021-11-22 15:15:07,842 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-22 15:15:07,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:15:07" (2/3) ... [2021-11-22 15:15:07,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a39a6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 03:15:07, skipping insertion in model container [2021-11-22 15:15:07,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-22 15:15:07,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:15:07" (3/3) ... [2021-11-22 15:15:07,845 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2021-11-22 15:15:07,904 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-22 15:15:07,904 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-22 15:15:07,905 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-22 15:15:07,905 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-22 15:15:07,905 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-22 15:15:07,905 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-22 15:15:07,906 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-22 15:15:07,906 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-22 15:15:07,928 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-11-22 15:15:07,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-11-22 15:15:07,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:07,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:07,967 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:07,967 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:07,967 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-22 15:15:07,969 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-11-22 15:15:07,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-11-22 15:15:07,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:07,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:07,981 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:07,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] [2021-11-22 15:15:07,991 INFO L791 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 21#L225-1true [2021-11-22 15:15:07,993 INFO L793 eck$LassoCheckResult]: Loop: 21#L225-1true assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33#L58true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 29#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 26#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 14#L97-1true assume !(0 != main_~p3~0#1); 17#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 51#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 46#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 13#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 23#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 31#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 18#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 36#L129-1true assume !(0 != main_~p11~0#1); 4#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 41#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 55#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 49#L149-1true assume !(0 != main_~p1~0#1); 48#L155-1true assume !(0 != main_~p2~0#1); 28#L160-1true assume !(0 != main_~p3~0#1); 12#L165-1true assume !(0 != main_~p4~0#1); 43#L170-1true assume !(0 != main_~p5~0#1); 47#L175-1true assume !(0 != main_~p6~0#1); 19#L180-1true assume !(0 != main_~p7~0#1); 40#L185-1true assume !(0 != main_~p8~0#1); 25#L190-1true assume !(0 != main_~p9~0#1); 42#L195-1true assume !(0 != main_~p10~0#1); 16#L200-1true assume !(0 != main_~p11~0#1); 45#L205-1true assume !(0 != main_~p12~0#1); 24#L210-1true assume !(0 != main_~p13~0#1); 6#L215-1true assume !(0 != main_~p14~0#1); 38#L220-1true assume !(0 != main_~p15~0#1); 21#L225-1true [2021-11-22 15:15:08,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-22 15:15:08,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:08,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605255150] [2021-11-22 15:15:08,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:08,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:08,162 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:08,240 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:08,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:08,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2064553094, now seen corresponding path program 1 times [2021-11-22 15:15:08,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:08,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245643198] [2021-11-22 15:15:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:08,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:08,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:08,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245643198] [2021-11-22 15:15:08,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245643198] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:08,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:08,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:08,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123806538] [2021-11-22 15:15:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:08,493 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:08,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:08,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:08,549 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:08,647 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2021-11-22 15:15:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:08,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2021-11-22 15:15:08,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-11-22 15:15:08,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 153 transitions. [2021-11-22 15:15:08,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2021-11-22 15:15:08,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2021-11-22 15:15:08,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 153 transitions. [2021-11-22 15:15:08,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:08,699 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-11-22 15:15:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 153 transitions. [2021-11-22 15:15:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-11-22 15:15:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2021-11-22 15:15:08,763 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-11-22 15:15:08,764 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-11-22 15:15:08,764 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-22 15:15:08,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 153 transitions. [2021-11-22 15:15:08,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-11-22 15:15:08,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:08,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:08,780 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:08,781 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:08,781 INFO L791 eck$LassoCheckResult]: Stem: 215#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 209#L225-1 [2021-11-22 15:15:08,782 INFO L793 eck$LassoCheckResult]: Loop: 209#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 237#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 236#L93 assume !(0 != main_~p1~0#1); 235#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 234#L97-1 assume !(0 != main_~p3~0#1); 233#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 220#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 216#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 183#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 184#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 199#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 191#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 192#L129-1 assume !(0 != main_~p11~0#1); 168#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 169#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 173#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 212#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 221#L149-1 assume !(0 != main_~p1~0#1); 222#L155-1 assume !(0 != main_~p2~0#1); 261#L160-1 assume !(0 != main_~p3~0#1); 259#L165-1 assume !(0 != main_~p4~0#1); 256#L170-1 assume !(0 != main_~p5~0#1); 255#L175-1 assume !(0 != main_~p6~0#1); 253#L180-1 assume !(0 != main_~p7~0#1); 250#L185-1 assume !(0 != main_~p8~0#1); 249#L190-1 assume !(0 != main_~p9~0#1); 247#L195-1 assume !(0 != main_~p10~0#1); 187#L200-1 assume !(0 != main_~p11~0#1); 188#L205-1 assume !(0 != main_~p12~0#1); 206#L210-1 assume !(0 != main_~p13~0#1); 241#L215-1 assume !(0 != main_~p14~0#1); 239#L220-1 assume !(0 != main_~p15~0#1); 209#L225-1 [2021-11-22 15:15:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:08,785 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-11-22 15:15:08,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:08,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782238571] [2021-11-22 15:15:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:08,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:08,810 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:08,834 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:08,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:08,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2087185348, now seen corresponding path program 1 times [2021-11-22 15:15:08,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:08,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077498432] [2021-11-22 15:15:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:08,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:08,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:08,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077498432] [2021-11-22 15:15:08,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077498432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:08,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:08,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:08,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228563857] [2021-11-22 15:15:08,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:08,910 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:08,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:08,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:08,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:08,912 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:08,948 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2021-11-22 15:15:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:08,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 298 transitions. [2021-11-22 15:15:08,963 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-11-22 15:15:08,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 298 transitions. [2021-11-22 15:15:08,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2021-11-22 15:15:08,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2021-11-22 15:15:08,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 298 transitions. [2021-11-22 15:15:08,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:08,981 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-11-22 15:15:08,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 298 transitions. [2021-11-22 15:15:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-11-22 15:15:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 185 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2021-11-22 15:15:09,016 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-11-22 15:15:09,016 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-11-22 15:15:09,016 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-22 15:15:09,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 298 transitions. [2021-11-22 15:15:09,020 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-11-22 15:15:09,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:09,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:09,024 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:09,024 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:09,025 INFO L791 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 499#L225-1 [2021-11-22 15:15:09,026 INFO L793 eck$LassoCheckResult]: Loop: 499#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 554#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 552#L93 assume !(0 != main_~p1~0#1); 537#L93-2 assume !(0 != main_~p2~0#1); 538#L97-1 assume !(0 != main_~p3~0#1); 533#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 514#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 509#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 470#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 471#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 486#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 478#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 479#L129-1 assume !(0 != main_~p11~0#1); 455#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 456#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 460#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 515#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 516#L149-1 assume !(0 != main_~p1~0#1); 540#L155-1 assume !(0 != main_~p2~0#1); 591#L160-1 assume !(0 != main_~p3~0#1); 589#L165-1 assume !(0 != main_~p4~0#1); 586#L170-1 assume !(0 != main_~p5~0#1); 585#L175-1 assume !(0 != main_~p6~0#1); 583#L180-1 assume !(0 != main_~p7~0#1); 580#L185-1 assume !(0 != main_~p8~0#1); 579#L190-1 assume !(0 != main_~p9~0#1); 577#L195-1 assume !(0 != main_~p10~0#1); 575#L200-1 assume !(0 != main_~p11~0#1); 573#L205-1 assume !(0 != main_~p12~0#1); 571#L210-1 assume !(0 != main_~p13~0#1); 569#L215-1 assume !(0 != main_~p14~0#1); 558#L220-1 assume !(0 != main_~p15~0#1); 499#L225-1 [2021-11-22 15:15:09,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:09,027 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-11-22 15:15:09,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:09,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543620537] [2021-11-22 15:15:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:09,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:09,054 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:09,078 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:09,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash -821578554, now seen corresponding path program 1 times [2021-11-22 15:15:09,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:09,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094000432] [2021-11-22 15:15:09,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:09,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:09,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:09,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094000432] [2021-11-22 15:15:09,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094000432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:09,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:09,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:09,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787027443] [2021-11-22 15:15:09,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:09,202 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:09,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:09,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:09,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:09,203 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. cyclomatic complexity: 116 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:09,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:09,231 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2021-11-22 15:15:09,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:09,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 582 transitions. [2021-11-22 15:15:09,238 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-11-22 15:15:09,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 582 transitions. [2021-11-22 15:15:09,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2021-11-22 15:15:09,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2021-11-22 15:15:09,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 582 transitions. [2021-11-22 15:15:09,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:09,246 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-11-22 15:15:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 582 transitions. [2021-11-22 15:15:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-11-22 15:15:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.5901639344262295) internal successors, (582), 365 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2021-11-22 15:15:09,268 INFO L704 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-11-22 15:15:09,268 INFO L587 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-11-22 15:15:09,268 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-22 15:15:09,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 582 transitions. [2021-11-22 15:15:09,271 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-11-22 15:15:09,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:09,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:09,272 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:09,273 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:09,273 INFO L791 eck$LassoCheckResult]: Stem: 1067#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1057#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1058#L225-1 [2021-11-22 15:15:09,273 INFO L793 eck$LassoCheckResult]: Loop: 1058#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1096#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1092#L93 assume !(0 != main_~p1~0#1); 1085#L93-2 assume !(0 != main_~p2~0#1); 1086#L97-1 assume !(0 != main_~p3~0#1); 1237#L101-1 assume !(0 != main_~p4~0#1); 1234#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1232#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1228#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1224#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1220#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1216#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1212#L129-1 assume !(0 != main_~p11~0#1); 1208#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1204#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1200#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1196#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1190#L149-1 assume !(0 != main_~p1~0#1); 1188#L155-1 assume !(0 != main_~p2~0#1); 1187#L160-1 assume !(0 != main_~p3~0#1); 1182#L165-1 assume !(0 != main_~p4~0#1); 1175#L170-1 assume !(0 != main_~p5~0#1); 1127#L175-1 assume !(0 != main_~p6~0#1); 1123#L180-1 assume !(0 != main_~p7~0#1); 1120#L185-1 assume !(0 != main_~p8~0#1); 1119#L190-1 assume !(0 != main_~p9~0#1); 1117#L195-1 assume !(0 != main_~p10~0#1); 1115#L200-1 assume !(0 != main_~p11~0#1); 1113#L205-1 assume !(0 != main_~p12~0#1); 1111#L210-1 assume !(0 != main_~p13~0#1); 1109#L215-1 assume !(0 != main_~p14~0#1); 1107#L220-1 assume !(0 != main_~p15~0#1); 1058#L225-1 [2021-11-22 15:15:09,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-11-22 15:15:09,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:09,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702780075] [2021-11-22 15:15:09,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:09,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:09,281 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:09,290 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:09,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:09,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1101649480, now seen corresponding path program 1 times [2021-11-22 15:15:09,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:09,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306471482] [2021-11-22 15:15:09,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:09,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:09,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:09,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:09,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306471482] [2021-11-22 15:15:09,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306471482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:09,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:09,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:09,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813125105] [2021-11-22 15:15:09,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:09,353 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:09,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:09,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:09,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:09,357 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. cyclomatic complexity: 224 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:09,404 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2021-11-22 15:15:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:09,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1138 transitions. [2021-11-22 15:15:09,422 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-11-22 15:15:09,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1138 transitions. [2021-11-22 15:15:09,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2021-11-22 15:15:09,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2021-11-22 15:15:09,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1138 transitions. [2021-11-22 15:15:09,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:09,443 INFO L681 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-11-22 15:15:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1138 transitions. [2021-11-22 15:15:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2021-11-22 15:15:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5761772853185596) internal successors, (1138), 721 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1138 transitions. [2021-11-22 15:15:09,475 INFO L704 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-11-22 15:15:09,475 INFO L587 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-11-22 15:15:09,475 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-22 15:15:09,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1138 transitions. [2021-11-22 15:15:09,482 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-11-22 15:15:09,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:09,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:09,483 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:09,483 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:09,483 INFO L791 eck$LassoCheckResult]: Stem: 2156#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 2149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2150#L225-1 [2021-11-22 15:15:09,483 INFO L793 eck$LassoCheckResult]: Loop: 2150#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2251#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 2247#L93 assume !(0 != main_~p1~0#1); 2240#L93-2 assume !(0 != main_~p2~0#1); 2235#L97-1 assume !(0 != main_~p3~0#1); 2228#L101-1 assume !(0 != main_~p4~0#1); 2222#L105-1 assume !(0 != main_~p5~0#1); 2218#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2216#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2214#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2212#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2210#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2207#L129-1 assume !(0 != main_~p11~0#1); 2208#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2201#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2202#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2194#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2195#L149-1 assume !(0 != main_~p1~0#1); 2184#L155-1 assume !(0 != main_~p2~0#1); 2186#L160-1 assume !(0 != main_~p3~0#1); 2363#L165-1 assume !(0 != main_~p4~0#1); 2351#L170-1 assume !(0 != main_~p5~0#1); 2350#L175-1 assume !(0 != main_~p6~0#1); 2348#L180-1 assume !(0 != main_~p7~0#1); 2344#L185-1 assume !(0 != main_~p8~0#1); 2339#L190-1 assume !(0 != main_~p9~0#1); 2333#L195-1 assume !(0 != main_~p10~0#1); 2282#L200-1 assume !(0 != main_~p11~0#1); 2280#L205-1 assume !(0 != main_~p12~0#1); 2274#L210-1 assume !(0 != main_~p13~0#1); 2270#L215-1 assume !(0 != main_~p14~0#1); 2260#L220-1 assume !(0 != main_~p15~0#1); 2150#L225-1 [2021-11-22 15:15:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:09,484 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-11-22 15:15:09,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:09,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116093180] [2021-11-22 15:15:09,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:09,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:09,491 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:09,499 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1163689094, now seen corresponding path program 1 times [2021-11-22 15:15:09,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:09,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113914873] [2021-11-22 15:15:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:09,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:09,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-11-22 15:15:09,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:09,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113914873] [2021-11-22 15:15:09,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113914873] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:09,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:09,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:09,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152525886] [2021-11-22 15:15:09,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:09,552 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:09,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:09,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:09,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:09,554 INFO L87 Difference]: Start difference. First operand 722 states and 1138 transitions. cyclomatic complexity: 432 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:09,583 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2021-11-22 15:15:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:09,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2226 transitions. [2021-11-22 15:15:09,606 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-11-22 15:15:09,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2226 transitions. [2021-11-22 15:15:09,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2021-11-22 15:15:09,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2021-11-22 15:15:09,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2226 transitions. [2021-11-22 15:15:09,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:09,630 INFO L681 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-11-22 15:15:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2226 transitions. [2021-11-22 15:15:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2021-11-22 15:15:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5610098176718092) internal successors, (2226), 1425 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2226 transitions. [2021-11-22 15:15:09,707 INFO L704 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-11-22 15:15:09,707 INFO L587 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-11-22 15:15:09,707 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-22 15:15:09,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2226 transitions. [2021-11-22 15:15:09,720 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-11-22 15:15:09,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:09,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:09,721 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:09,722 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:09,722 INFO L791 eck$LassoCheckResult]: Stem: 4313#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 4305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4306#L225-1 [2021-11-22 15:15:09,722 INFO L793 eck$LassoCheckResult]: Loop: 4306#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4520#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 4521#L93 assume !(0 != main_~p1~0#1); 4734#L93-2 assume !(0 != main_~p2~0#1); 4733#L97-1 assume !(0 != main_~p3~0#1); 4731#L101-1 assume !(0 != main_~p4~0#1); 4728#L105-1 assume !(0 != main_~p5~0#1); 4724#L109-1 assume !(0 != main_~p6~0#1); 4722#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4720#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4718#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4716#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4714#L129-1 assume !(0 != main_~p11~0#1); 4712#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4710#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4708#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4706#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4703#L149-1 assume !(0 != main_~p1~0#1); 4704#L155-1 assume !(0 != main_~p2~0#1); 4753#L160-1 assume !(0 != main_~p3~0#1); 4654#L165-1 assume !(0 != main_~p4~0#1); 4655#L170-1 assume !(0 != main_~p5~0#1); 4643#L175-1 assume !(0 != main_~p6~0#1); 4645#L180-1 assume !(0 != main_~p7~0#1); 4627#L185-1 assume !(0 != main_~p8~0#1); 4628#L190-1 assume !(0 != main_~p9~0#1); 4612#L195-1 assume !(0 != main_~p10~0#1); 4611#L200-1 assume !(0 != main_~p11~0#1); 4595#L205-1 assume !(0 != main_~p12~0#1); 4587#L210-1 assume !(0 != main_~p13~0#1); 4586#L215-1 assume !(0 != main_~p14~0#1); 4540#L220-1 assume !(0 != main_~p15~0#1); 4306#L225-1 [2021-11-22 15:15:09,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-11-22 15:15:09,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:09,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255191272] [2021-11-22 15:15:09,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:09,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:09,733 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:09,750 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1304237704, now seen corresponding path program 1 times [2021-11-22 15:15:09,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:09,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472846337] [2021-11-22 15:15:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:09,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:09,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:09,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472846337] [2021-11-22 15:15:09,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472846337] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:09,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:09,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:09,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700061299] [2021-11-22 15:15:09,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:09,830 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:09,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:09,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:09,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:09,833 INFO L87 Difference]: Start difference. First operand 1426 states and 2226 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:09,878 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2021-11-22 15:15:09,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:09,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4354 transitions. [2021-11-22 15:15:09,937 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-11-22 15:15:09,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4354 transitions. [2021-11-22 15:15:09,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2021-11-22 15:15:09,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2021-11-22 15:15:09,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4354 transitions. [2021-11-22 15:15:09,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:09,981 INFO L681 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-11-22 15:15:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4354 transitions. [2021-11-22 15:15:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2021-11-22 15:15:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.5450674237047552) internal successors, (4354), 2817 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4354 transitions. [2021-11-22 15:15:10,078 INFO L704 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-11-22 15:15:10,078 INFO L587 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-11-22 15:15:10,080 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-22 15:15:10,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4354 transitions. [2021-11-22 15:15:10,113 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-11-22 15:15:10,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:10,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:10,118 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:10,118 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:10,119 INFO L791 eck$LassoCheckResult]: Stem: 8576#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 8562#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8563#L225-1 [2021-11-22 15:15:10,120 INFO L793 eck$LassoCheckResult]: Loop: 8563#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8727#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 8725#L93 assume !(0 != main_~p1~0#1); 8724#L93-2 assume !(0 != main_~p2~0#1); 8718#L97-1 assume !(0 != main_~p3~0#1); 8719#L101-1 assume !(0 != main_~p4~0#1); 8825#L105-1 assume !(0 != main_~p5~0#1); 8822#L109-1 assume !(0 != main_~p6~0#1); 8818#L113-1 assume !(0 != main_~p7~0#1); 8816#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8815#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8812#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8809#L129-1 assume !(0 != main_~p11~0#1); 8806#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8802#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8798#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8793#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8787#L149-1 assume !(0 != main_~p1~0#1); 8781#L155-1 assume !(0 != main_~p2~0#1); 8776#L160-1 assume !(0 != main_~p3~0#1); 8769#L165-1 assume !(0 != main_~p4~0#1); 8763#L170-1 assume !(0 != main_~p5~0#1); 8758#L175-1 assume !(0 != main_~p6~0#1); 8756#L180-1 assume !(0 != main_~p7~0#1); 8750#L185-1 assume !(0 != main_~p8~0#1); 8747#L190-1 assume !(0 != main_~p9~0#1); 8743#L195-1 assume !(0 != main_~p10~0#1); 8737#L200-1 assume !(0 != main_~p11~0#1); 8735#L205-1 assume !(0 != main_~p12~0#1); 8733#L210-1 assume !(0 != main_~p13~0#1); 8731#L215-1 assume !(0 != main_~p14~0#1); 8729#L220-1 assume !(0 != main_~p15~0#1); 8563#L225-1 [2021-11-22 15:15:10,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-11-22 15:15:10,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:10,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274731184] [2021-11-22 15:15:10,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:10,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:10,131 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:10,155 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:10,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:10,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1170224198, now seen corresponding path program 1 times [2021-11-22 15:15:10,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:10,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532343895] [2021-11-22 15:15:10,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:10,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:10,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:10,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532343895] [2021-11-22 15:15:10,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532343895] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:10,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:10,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:10,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772575514] [2021-11-22 15:15:10,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:10,221 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:10,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:10,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:10,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:10,223 INFO L87 Difference]: Start difference. First operand 2818 states and 4354 transitions. cyclomatic complexity: 1600 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:10,350 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2021-11-22 15:15:10,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:10,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8514 transitions. [2021-11-22 15:15:10,428 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-11-22 15:15:10,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8514 transitions. [2021-11-22 15:15:10,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2021-11-22 15:15:10,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2021-11-22 15:15:10,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8514 transitions. [2021-11-22 15:15:10,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:10,523 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-11-22 15:15:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8514 transitions. [2021-11-22 15:15:10,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2021-11-22 15:15:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.5285457809694794) internal successors, (8514), 5569 states have internal predecessors, (8514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8514 transitions. [2021-11-22 15:15:10,785 INFO L704 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-11-22 15:15:10,785 INFO L587 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-11-22 15:15:10,785 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-22 15:15:10,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8514 transitions. [2021-11-22 15:15:10,842 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-11-22 15:15:10,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:10,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:10,843 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:10,843 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:10,844 INFO L791 eck$LassoCheckResult]: Stem: 16963#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 16949#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16950#L225-1 [2021-11-22 15:15:10,845 INFO L793 eck$LassoCheckResult]: Loop: 16950#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17206#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 17200#L93 assume !(0 != main_~p1~0#1); 17196#L93-2 assume !(0 != main_~p2~0#1); 17193#L97-1 assume !(0 != main_~p3~0#1); 17187#L101-1 assume !(0 != main_~p4~0#1); 17181#L105-1 assume !(0 != main_~p5~0#1); 17177#L109-1 assume !(0 != main_~p6~0#1); 17172#L113-1 assume !(0 != main_~p7~0#1); 17166#L117-1 assume !(0 != main_~p8~0#1); 17167#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 17154#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17155#L129-1 assume !(0 != main_~p11~0#1); 17146#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17147#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17138#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17139#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17128#L149-1 assume !(0 != main_~p1~0#1); 17129#L155-1 assume !(0 != main_~p2~0#1); 17118#L160-1 assume !(0 != main_~p3~0#1); 17117#L165-1 assume !(0 != main_~p4~0#1); 17104#L170-1 assume !(0 != main_~p5~0#1); 17105#L175-1 assume !(0 != main_~p6~0#1); 17095#L180-1 assume !(0 != main_~p7~0#1); 17096#L185-1 assume !(0 != main_~p8~0#1); 17248#L190-1 assume !(0 != main_~p9~0#1); 17244#L195-1 assume !(0 != main_~p10~0#1); 17240#L200-1 assume !(0 != main_~p11~0#1); 17234#L205-1 assume !(0 != main_~p12~0#1); 17228#L210-1 assume !(0 != main_~p13~0#1); 17222#L215-1 assume !(0 != main_~p14~0#1); 17216#L220-1 assume !(0 != main_~p15~0#1); 16950#L225-1 [2021-11-22 15:15:10,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-11-22 15:15:10,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:10,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267095370] [2021-11-22 15:15:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:10,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:10,853 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:10,878 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:10,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:10,879 INFO L85 PathProgramCache]: Analyzing trace with hash -635214136, now seen corresponding path program 1 times [2021-11-22 15:15:10,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:10,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213045352] [2021-11-22 15:15:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:10,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:10,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:10,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213045352] [2021-11-22 15:15:10,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213045352] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:10,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:10,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:10,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140415497] [2021-11-22 15:15:10,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:10,931 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:10,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:10,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:10,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:10,932 INFO L87 Difference]: Start difference. First operand 5570 states and 8514 transitions. cyclomatic complexity: 3072 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:11,085 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2021-11-22 15:15:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:11,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16642 transitions. [2021-11-22 15:15:11,179 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-11-22 15:15:11,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16642 transitions. [2021-11-22 15:15:11,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2021-11-22 15:15:11,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2021-11-22 15:15:11,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16642 transitions. [2021-11-22 15:15:11,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:11,321 INFO L681 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-11-22 15:15:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16642 transitions. [2021-11-22 15:15:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2021-11-22 15:15:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.5115349682107175) internal successors, (16642), 11009 states have internal predecessors, (16642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16642 transitions. [2021-11-22 15:15:11,684 INFO L704 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-11-22 15:15:11,684 INFO L587 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-11-22 15:15:11,684 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-22 15:15:11,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16642 transitions. [2021-11-22 15:15:11,814 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-11-22 15:15:11,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:11,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:11,815 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:11,815 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:11,815 INFO L791 eck$LassoCheckResult]: Stem: 33547#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 33535#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33536#L225-1 [2021-11-22 15:15:11,818 INFO L793 eck$LassoCheckResult]: Loop: 33536#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 34190#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 34191#L93 assume !(0 != main_~p1~0#1); 34313#L93-2 assume !(0 != main_~p2~0#1); 34311#L97-1 assume !(0 != main_~p3~0#1); 34307#L101-1 assume !(0 != main_~p4~0#1); 34304#L105-1 assume !(0 != main_~p5~0#1); 34302#L109-1 assume !(0 != main_~p6~0#1); 34298#L113-1 assume !(0 != main_~p7~0#1); 34294#L117-1 assume !(0 != main_~p8~0#1); 34290#L121-1 assume !(0 != main_~p9~0#1); 34288#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 34286#L129-1 assume !(0 != main_~p11~0#1); 34284#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 34282#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 34280#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 34278#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 34274#L149-1 assume !(0 != main_~p1~0#1); 34270#L155-1 assume !(0 != main_~p2~0#1); 34267#L160-1 assume !(0 != main_~p3~0#1); 34262#L165-1 assume !(0 != main_~p4~0#1); 34258#L170-1 assume !(0 != main_~p5~0#1); 34256#L175-1 assume !(0 != main_~p6~0#1); 34233#L180-1 assume !(0 != main_~p7~0#1); 34234#L185-1 assume !(0 != main_~p8~0#1); 34227#L190-1 assume !(0 != main_~p9~0#1); 34229#L195-1 assume !(0 != main_~p10~0#1); 34223#L200-1 assume !(0 != main_~p11~0#1); 34222#L205-1 assume !(0 != main_~p12~0#1); 34217#L210-1 assume !(0 != main_~p13~0#1); 34216#L215-1 assume !(0 != main_~p14~0#1); 34208#L220-1 assume !(0 != main_~p15~0#1); 33536#L225-1 [2021-11-22 15:15:11,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-11-22 15:15:11,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:11,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873261279] [2021-11-22 15:15:11,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:11,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:11,827 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:11,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash -416359418, now seen corresponding path program 1 times [2021-11-22 15:15:11,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:11,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307315974] [2021-11-22 15:15:11,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:11,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:11,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:11,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307315974] [2021-11-22 15:15:11,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307315974] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:11,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:11,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:11,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374941356] [2021-11-22 15:15:11,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:11,900 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:11,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:11,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:11,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:11,902 INFO L87 Difference]: Start difference. First operand 11010 states and 16642 transitions. cyclomatic complexity: 5888 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:12,017 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2021-11-22 15:15:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:12,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 32514 transitions. [2021-11-22 15:15:12,231 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-11-22 15:15:12,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 32514 transitions. [2021-11-22 15:15:12,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2021-11-22 15:15:12,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2021-11-22 15:15:12,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 32514 transitions. [2021-11-22 15:15:12,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:12,497 INFO L681 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-11-22 15:15:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 32514 transitions. [2021-11-22 15:15:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2021-11-22 15:15:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.4940722360077199) internal successors, (32514), 21761 states have internal predecessors, (32514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 32514 transitions. [2021-11-22 15:15:13,300 INFO L704 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-11-22 15:15:13,300 INFO L587 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-11-22 15:15:13,300 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-22 15:15:13,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 32514 transitions. [2021-11-22 15:15:13,388 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-11-22 15:15:13,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:13,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:13,389 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:13,389 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:13,390 INFO L791 eck$LassoCheckResult]: Stem: 66322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 66310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66311#L225-1 [2021-11-22 15:15:13,390 INFO L793 eck$LassoCheckResult]: Loop: 66311#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66629#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 66630#L93 assume !(0 != main_~p1~0#1); 66617#L93-2 assume !(0 != main_~p2~0#1); 66619#L97-1 assume !(0 != main_~p3~0#1); 66606#L101-1 assume !(0 != main_~p4~0#1); 66608#L105-1 assume !(0 != main_~p5~0#1); 66710#L109-1 assume !(0 != main_~p6~0#1); 66708#L113-1 assume !(0 != main_~p7~0#1); 66705#L117-1 assume !(0 != main_~p8~0#1); 66702#L121-1 assume !(0 != main_~p9~0#1); 66700#L125-1 assume !(0 != main_~p10~0#1); 66699#L129-1 assume !(0 != main_~p11~0#1); 66698#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 66697#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66696#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66694#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66691#L149-1 assume !(0 != main_~p1~0#1); 66688#L155-1 assume !(0 != main_~p2~0#1); 66686#L160-1 assume !(0 != main_~p3~0#1); 66530#L165-1 assume !(0 != main_~p4~0#1); 66531#L170-1 assume !(0 != main_~p5~0#1); 66516#L175-1 assume !(0 != main_~p6~0#1); 66517#L180-1 assume !(0 != main_~p7~0#1); 66683#L185-1 assume !(0 != main_~p8~0#1); 66671#L190-1 assume !(0 != main_~p9~0#1); 66673#L195-1 assume !(0 != main_~p10~0#1); 66661#L200-1 assume !(0 != main_~p11~0#1); 66660#L205-1 assume !(0 != main_~p12~0#1); 66651#L210-1 assume !(0 != main_~p13~0#1); 66650#L215-1 assume !(0 != main_~p14~0#1); 66639#L220-1 assume !(0 != main_~p15~0#1); 66311#L225-1 [2021-11-22 15:15:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-11-22 15:15:13,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:13,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818891846] [2021-11-22 15:15:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:13,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:13,396 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:13,402 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:13,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:13,402 INFO L85 PathProgramCache]: Analyzing trace with hash 6342408, now seen corresponding path program 1 times [2021-11-22 15:15:13,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:13,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498516879] [2021-11-22 15:15:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:13,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:13,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:13,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498516879] [2021-11-22 15:15:13,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498516879] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:13,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:13,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:13,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832434375] [2021-11-22 15:15:13,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:13,435 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:13,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:13,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:13,440 INFO L87 Difference]: Start difference. First operand 21762 states and 32514 transitions. cyclomatic complexity: 11264 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:13,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:13,771 INFO L93 Difference]: Finished difference Result 43010 states and 63490 transitions. [2021-11-22 15:15:13,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:13,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 63490 transitions. [2021-11-22 15:15:14,202 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-11-22 15:15:14,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 63490 transitions. [2021-11-22 15:15:14,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2021-11-22 15:15:14,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2021-11-22 15:15:14,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 63490 transitions. [2021-11-22 15:15:14,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:14,568 INFO L681 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-11-22 15:15:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 63490 transitions. [2021-11-22 15:15:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2021-11-22 15:15:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4761683329458266) internal successors, (63490), 43009 states have internal predecessors, (63490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 63490 transitions. [2021-11-22 15:15:15,728 INFO L704 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-11-22 15:15:15,729 INFO L587 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-11-22 15:15:15,729 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-22 15:15:15,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 63490 transitions. [2021-11-22 15:15:16,146 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-11-22 15:15:16,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:16,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:16,148 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:16,148 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:16,148 INFO L791 eck$LassoCheckResult]: Stem: 131098#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 131087#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131088#L225-1 [2021-11-22 15:15:16,149 INFO L793 eck$LassoCheckResult]: Loop: 131088#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 131568#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 131565#L93 assume !(0 != main_~p1~0#1); 131561#L93-2 assume !(0 != main_~p2~0#1); 131558#L97-1 assume !(0 != main_~p3~0#1); 131547#L101-1 assume !(0 != main_~p4~0#1); 131536#L105-1 assume !(0 != main_~p5~0#1); 131527#L109-1 assume !(0 != main_~p6~0#1); 131517#L113-1 assume !(0 != main_~p7~0#1); 131511#L117-1 assume !(0 != main_~p8~0#1); 131505#L121-1 assume !(0 != main_~p9~0#1); 131498#L125-1 assume !(0 != main_~p10~0#1); 131493#L129-1 assume !(0 != main_~p11~0#1); 131423#L133-1 assume !(0 != main_~p12~0#1); 131424#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 131409#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 131410#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 131392#L149-1 assume !(0 != main_~p1~0#1); 131393#L155-1 assume !(0 != main_~p2~0#1); 131373#L160-1 assume !(0 != main_~p3~0#1); 131372#L165-1 assume !(0 != main_~p4~0#1); 131349#L170-1 assume !(0 != main_~p5~0#1); 131350#L175-1 assume !(0 != main_~p6~0#1); 131327#L180-1 assume !(0 != main_~p7~0#1); 131328#L185-1 assume !(0 != main_~p8~0#1); 131309#L190-1 assume !(0 != main_~p9~0#1); 131311#L195-1 assume !(0 != main_~p10~0#1); 131469#L200-1 assume !(0 != main_~p11~0#1); 131464#L205-1 assume !(0 != main_~p12~0#1); 131465#L210-1 assume !(0 != main_~p13~0#1); 131576#L215-1 assume !(0 != main_~p14~0#1); 131573#L220-1 assume !(0 != main_~p15~0#1); 131088#L225-1 [2021-11-22 15:15:16,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-11-22 15:15:16,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:16,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899431770] [2021-11-22 15:15:16,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:16,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:16,159 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:16,172 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:16,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1682601334, now seen corresponding path program 1 times [2021-11-22 15:15:16,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:16,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754222509] [2021-11-22 15:15:16,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:16,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:16,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:16,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754222509] [2021-11-22 15:15:16,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754222509] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:16,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:16,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:16,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806986737] [2021-11-22 15:15:16,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:16,224 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:16,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:16,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:16,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:16,226 INFO L87 Difference]: Start difference. First operand 43010 states and 63490 transitions. cyclomatic complexity: 21504 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:16,755 INFO L93 Difference]: Finished difference Result 84994 states and 123906 transitions. [2021-11-22 15:15:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:16,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 123906 transitions. [2021-11-22 15:15:17,323 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-11-22 15:15:17,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 123906 transitions. [2021-11-22 15:15:17,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2021-11-22 15:15:17,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2021-11-22 15:15:17,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 123906 transitions. [2021-11-22 15:15:17,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:17,977 INFO L681 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-11-22 15:15:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 123906 transitions. [2021-11-22 15:15:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2021-11-22 15:15:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.4578205520389675) internal successors, (123906), 84993 states have internal predecessors, (123906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 123906 transitions. [2021-11-22 15:15:20,043 INFO L704 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-11-22 15:15:20,043 INFO L587 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-11-22 15:15:20,044 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-22 15:15:20,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 123906 transitions. [2021-11-22 15:15:20,270 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-11-22 15:15:20,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:20,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:20,272 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:20,272 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:20,272 INFO L791 eck$LassoCheckResult]: Stem: 259116#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 259105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259106#L225-1 [2021-11-22 15:15:20,273 INFO L793 eck$LassoCheckResult]: Loop: 259106#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 260093#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 260071#L93 assume !(0 != main_~p1~0#1); 260073#L93-2 assume !(0 != main_~p2~0#1); 260053#L97-1 assume !(0 != main_~p3~0#1); 260054#L101-1 assume !(0 != main_~p4~0#1); 260027#L105-1 assume !(0 != main_~p5~0#1); 260029#L109-1 assume !(0 != main_~p6~0#1); 260313#L113-1 assume !(0 != main_~p7~0#1); 260283#L117-1 assume !(0 != main_~p8~0#1); 260285#L121-1 assume !(0 != main_~p9~0#1); 260309#L125-1 assume !(0 != main_~p10~0#1); 260308#L129-1 assume !(0 != main_~p11~0#1); 260306#L133-1 assume !(0 != main_~p12~0#1); 260304#L137-1 assume !(0 != main_~p13~0#1); 260302#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 260300#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 260297#L149-1 assume !(0 != main_~p1~0#1); 260293#L155-1 assume !(0 != main_~p2~0#1); 260290#L160-1 assume !(0 != main_~p3~0#1); 260225#L165-1 assume !(0 != main_~p4~0#1); 260226#L170-1 assume !(0 != main_~p5~0#1); 260202#L175-1 assume !(0 != main_~p6~0#1); 260204#L180-1 assume !(0 != main_~p7~0#1); 260181#L185-1 assume !(0 != main_~p8~0#1); 260182#L190-1 assume !(0 != main_~p9~0#1); 260176#L195-1 assume !(0 != main_~p10~0#1); 260178#L200-1 assume !(0 != main_~p11~0#1); 260125#L205-1 assume !(0 != main_~p12~0#1); 260127#L210-1 assume !(0 != main_~p13~0#1); 260112#L215-1 assume !(0 != main_~p14~0#1); 260111#L220-1 assume !(0 != main_~p15~0#1); 259106#L225-1 [2021-11-22 15:15:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-11-22 15:15:20,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:20,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347180017] [2021-11-22 15:15:20,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:20,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:20,278 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:20,282 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:20,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash 618221256, now seen corresponding path program 1 times [2021-11-22 15:15:20,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:20,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832917973] [2021-11-22 15:15:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:20,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:20,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:20,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832917973] [2021-11-22 15:15:20,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832917973] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:20,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:20,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 15:15:20,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592434558] [2021-11-22 15:15:20,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:20,333 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:20,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:20,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:20,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:20,334 INFO L87 Difference]: Start difference. First operand 84994 states and 123906 transitions. cyclomatic complexity: 40960 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:21,275 INFO L93 Difference]: Finished difference Result 167938 states and 241666 transitions. [2021-11-22 15:15:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:21,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167938 states and 241666 transitions. [2021-11-22 15:15:22,386 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2021-11-22 15:15:22,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167938 states to 167938 states and 241666 transitions. [2021-11-22 15:15:22,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167938 [2021-11-22 15:15:22,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167938 [2021-11-22 15:15:22,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167938 states and 241666 transitions. [2021-11-22 15:15:23,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:23,016 INFO L681 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-11-22 15:15:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167938 states and 241666 transitions. [2021-11-22 15:15:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167938 to 167938. [2021-11-22 15:15:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167938 states, 167938 states have (on average 1.4390191618335337) internal successors, (241666), 167937 states have internal predecessors, (241666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167938 states to 167938 states and 241666 transitions. [2021-11-22 15:15:25,843 INFO L704 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-11-22 15:15:25,843 INFO L587 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-11-22 15:15:25,844 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-22 15:15:25,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167938 states and 241666 transitions. [2021-11-22 15:15:27,128 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2021-11-22 15:15:27,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:27,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:27,131 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:27,131 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:27,132 INFO L791 eck$LassoCheckResult]: Stem: 512052#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 512037#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 512038#L225-1 [2021-11-22 15:15:27,132 INFO L793 eck$LassoCheckResult]: Loop: 512038#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 512371#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 512369#L93 assume !(0 != main_~p1~0#1); 512367#L93-2 assume !(0 != main_~p2~0#1); 512366#L97-1 assume !(0 != main_~p3~0#1); 512364#L101-1 assume !(0 != main_~p4~0#1); 512362#L105-1 assume !(0 != main_~p5~0#1); 512360#L109-1 assume !(0 != main_~p6~0#1); 512358#L113-1 assume !(0 != main_~p7~0#1); 512356#L117-1 assume !(0 != main_~p8~0#1); 512354#L121-1 assume !(0 != main_~p9~0#1); 512352#L125-1 assume !(0 != main_~p10~0#1); 512351#L129-1 assume !(0 != main_~p11~0#1); 512349#L133-1 assume !(0 != main_~p12~0#1); 512345#L137-1 assume !(0 != main_~p13~0#1); 512343#L141-1 assume !(0 != main_~p14~0#1); 512340#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 512336#L149-1 assume !(0 != main_~p1~0#1); 512330#L155-1 assume !(0 != main_~p2~0#1); 512325#L160-1 assume !(0 != main_~p3~0#1); 512318#L165-1 assume !(0 != main_~p4~0#1); 512312#L170-1 assume !(0 != main_~p5~0#1); 512306#L175-1 assume !(0 != main_~p6~0#1); 512300#L180-1 assume !(0 != main_~p7~0#1); 512294#L185-1 assume !(0 != main_~p8~0#1); 512288#L190-1 assume !(0 != main_~p9~0#1); 512282#L195-1 assume !(0 != main_~p10~0#1); 512277#L200-1 assume !(0 != main_~p11~0#1); 512270#L205-1 assume !(0 != main_~p12~0#1); 512261#L210-1 assume !(0 != main_~p13~0#1); 512262#L215-1 assume !(0 != main_~p14~0#1); 512373#L220-1 assume !(0 != main_~p15~0#1); 512038#L225-1 [2021-11-22 15:15:27,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:27,133 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2021-11-22 15:15:27,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:27,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501198803] [2021-11-22 15:15:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:27,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:27,171 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:27,185 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash -970126646, now seen corresponding path program 1 times [2021-11-22 15:15:27,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:27,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764514949] [2021-11-22 15:15:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:27,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:15:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:15:27,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:15:27,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764514949] [2021-11-22 15:15:27,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764514949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:15:27,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:15:27,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 15:15:27,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697405251] [2021-11-22 15:15:27,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:15:27,252 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-22 15:15:27,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:15:27,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 15:15:27,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 15:15:27,254 INFO L87 Difference]: Start difference. First operand 167938 states and 241666 transitions. cyclomatic complexity: 77824 Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:15:28,049 INFO L93 Difference]: Finished difference Result 331778 states and 471042 transitions. [2021-11-22 15:15:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 15:15:28,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331778 states and 471042 transitions. [2021-11-22 15:15:30,998 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2021-11-22 15:15:31,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331778 states to 331778 states and 471042 transitions. [2021-11-22 15:15:31,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331778 [2021-11-22 15:15:32,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331778 [2021-11-22 15:15:32,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331778 states and 471042 transitions. [2021-11-22 15:15:32,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:15:32,210 INFO L681 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-11-22 15:15:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331778 states and 471042 transitions. [2021-11-22 15:15:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331778 to 331778. [2021-11-22 15:15:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331778 states, 331778 states have (on average 1.419750556094738) internal successors, (471042), 331777 states have internal predecessors, (471042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:15:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331778 states to 331778 states and 471042 transitions. [2021-11-22 15:15:38,018 INFO L704 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-11-22 15:15:38,018 INFO L587 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-11-22 15:15:38,023 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-11-22 15:15:38,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331778 states and 471042 transitions. [2021-11-22 15:15:40,459 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2021-11-22 15:15:40,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:15:40,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:15:40,463 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:15:40,463 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:15:40,463 INFO L791 eck$LassoCheckResult]: Stem: 1011773#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1011759#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1011760#L225-1 [2021-11-22 15:15:40,463 INFO L793 eck$LassoCheckResult]: Loop: 1011760#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1012553#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1012551#L93 assume !(0 != main_~p1~0#1); 1012549#L93-2 assume !(0 != main_~p2~0#1); 1012548#L97-1 assume !(0 != main_~p3~0#1); 1012546#L101-1 assume !(0 != main_~p4~0#1); 1012544#L105-1 assume !(0 != main_~p5~0#1); 1012545#L109-1 assume !(0 != main_~p6~0#1); 1012707#L113-1 assume !(0 != main_~p7~0#1); 1012702#L117-1 assume !(0 != main_~p8~0#1); 1012697#L121-1 assume !(0 != main_~p9~0#1); 1012691#L125-1 assume !(0 != main_~p10~0#1); 1012687#L129-1 assume !(0 != main_~p11~0#1); 1012683#L133-1 assume !(0 != main_~p12~0#1); 1012678#L137-1 assume !(0 != main_~p13~0#1); 1012674#L141-1 assume !(0 != main_~p14~0#1); 1012668#L145-1 assume !(0 != main_~p15~0#1); 1012661#L149-1 assume !(0 != main_~p1~0#1); 1012653#L155-1 assume !(0 != main_~p2~0#1); 1012642#L160-1 assume !(0 != main_~p3~0#1); 1012638#L165-1 assume !(0 != main_~p4~0#1); 1012636#L170-1 assume !(0 != main_~p5~0#1); 1012632#L175-1 assume !(0 != main_~p6~0#1); 1012628#L180-1 assume !(0 != main_~p7~0#1); 1012624#L185-1 assume !(0 != main_~p8~0#1); 1012620#L190-1 assume !(0 != main_~p9~0#1); 1012616#L195-1 assume !(0 != main_~p10~0#1); 1012570#L200-1 assume !(0 != main_~p11~0#1); 1012560#L205-1 assume !(0 != main_~p12~0#1); 1012558#L210-1 assume !(0 != main_~p13~0#1); 1012556#L215-1 assume !(0 != main_~p14~0#1); 1012554#L220-1 assume !(0 != main_~p15~0#1); 1011760#L225-1 [2021-11-22 15:15:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:40,464 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2021-11-22 15:15:40,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:40,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413594603] [2021-11-22 15:15:40,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:40,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:40,479 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:40,485 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:40,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1991195000, now seen corresponding path program 1 times [2021-11-22 15:15:40,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:40,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570783951] [2021-11-22 15:15:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:40,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:40,492 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:40,514 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:40,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:15:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1845576266, now seen corresponding path program 1 times [2021-11-22 15:15:40,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:15:40,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187281224] [2021-11-22 15:15:40,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:15:40,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:15:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:40,522 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:15:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:15:40,549 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:15:41,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 03:15:41 BoogieIcfgContainer [2021-11-22 15:15:41,270 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-11-22 15:15:41,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 15:15:41,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 15:15:41,272 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 15:15:41,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:15:07" (3/4) ... [2021-11-22 15:15:41,276 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-11-22 15:15:41,345 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/witness.graphml [2021-11-22 15:15:41,346 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 15:15:41,347 INFO L158 Benchmark]: Toolchain (without parser) took 34582.84ms. Allocated memory was 98.6MB in the beginning and 14.2GB in the end (delta: 14.1GB). Free memory was 61.9MB in the beginning and 11.2GB in the end (delta: -11.1GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2021-11-22 15:15:41,347 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 15:15:41,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.06ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 73.4MB in the end (delta: -11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-22 15:15:41,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.51ms. Allocated memory is still 98.6MB. Free memory was 73.4MB in the beginning and 71.4MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-22 15:15:41,349 INFO L158 Benchmark]: Boogie Preprocessor took 51.73ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 70.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 15:15:41,349 INFO L158 Benchmark]: RCFGBuilder took 519.01ms. Allocated memory is still 98.6MB. Free memory was 70.1MB in the beginning and 57.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 15:15:41,350 INFO L158 Benchmark]: BuchiAutomizer took 33436.29ms. Allocated memory was 98.6MB in the beginning and 14.2GB in the end (delta: 14.1GB). Free memory was 56.8MB in the beginning and 11.2GB in the end (delta: -11.1GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2021-11-22 15:15:41,351 INFO L158 Benchmark]: Witness Printer took 74.40ms. Allocated memory is still 14.2GB. Free memory was 11.2GB in the beginning and 11.2GB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 15:15:41,353 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.19ms. Allocated memory is still 98.6MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.06ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 73.4MB in the end (delta: -11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.51ms. Allocated memory is still 98.6MB. Free memory was 73.4MB in the beginning and 71.4MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.73ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 70.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 519.01ms. Allocated memory is still 98.6MB. Free memory was 70.1MB in the beginning and 57.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 33436.29ms. Allocated memory was 98.6MB in the beginning and 14.2GB in the end (delta: 14.1GB). Free memory was 56.8MB in the beginning and 11.2GB in the end (delta: -11.1GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 74.40ms. Allocated memory is still 14.2GB. Free memory was 11.2GB in the beginning and 11.2GB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 331778 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 33.3s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 13.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 8.0s Buchi closure took 0.4s. Biggest automaton had 331778 states and ocurred in iteration 13. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 799 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 799 mSDsluCounter, 2497 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 967 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 1530 mSDtfsCounter, 65 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI13 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 56]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p11=0, p13=0, lk5=0, p1=0, NULL=0, p9=0, NULL=1, cond=4, p12=0, p10=0, p14=0, p8=0, lk6=0, lk15=0, p3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66683faf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3280d5b9=0, p15=0, \result=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66c62205=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57a544e7=0, lk14=0, p2=0, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6af22cb1=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@681d44b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bc4696d=0, lk13=0, lk9=0, lk12=0, p5=0, lk2=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@509472ed=0, lk11=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fc18b40=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7726bee1=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c933e06=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15b62944=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63bc7834=0, p6=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5245a895=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f1c9f58=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@663b9b31=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND FALSE !(p14 != 0) [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND FALSE !(p14 != 0) [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-11-22 15:15:41,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ac184e-104c-482e-9bcd-97202eaee75c/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)