./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt --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 7dd19b8066311da8c1eb1c6a0e6567bb02c0b787 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:30:18,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:30:18,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:30:18,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:30:18,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:30:18,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:30:18,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:30:18,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:30:18,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:30:18,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:30:18,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:30:18,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:30:18,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:30:18,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:30:18,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:30:18,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:30:18,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:30:18,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:30:18,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:30:18,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:30:18,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:30:18,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:30:18,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:30:18,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:30:18,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:30:18,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:30:18,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:30:18,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:30:18,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:30:18,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:30:18,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:30:18,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:30:18,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:30:18,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:30:18,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:30:18,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:30:18,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:30:18,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:30:18,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:30:18,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:30:18,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:30:18,926 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-13 00:30:18,958 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:30:18,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:30:18,958 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:30:18,959 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:30:18,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:30:18,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:30:18,960 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:30:18,960 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-13 00:30:18,961 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-13 00:30:18,961 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-13 00:30:18,961 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-13 00:30:18,961 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-13 00:30:18,961 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-13 00:30:18,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:30:18,962 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:30:18,962 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 00:30:18,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:30:18,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:30:18,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:30:18,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-13 00:30:18,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-13 00:30:18,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-13 00:30:18,963 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:30:18,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:30:18,964 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-13 00:30:18,964 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:30:18,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-13 00:30:18,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:30:18,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:30:18,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:30:18,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:30:18,965 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:30:18,967 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-13 00:30:18,967 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_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/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_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt 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 -> 7dd19b8066311da8c1eb1c6a0e6567bb02c0b787 [2021-10-13 00:30:19,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:30:19,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:30:19,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:30:19,267 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:30:19,268 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:30:19,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/locks/test_locks_14-2.c [2021-10-13 00:30:19,341 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/data/cae76897f/5742718a12cd4cd88bf48f590f226d2f/FLAG3442f1f5c [2021-10-13 00:30:19,796 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:30:19,797 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/sv-benchmarks/c/locks/test_locks_14-2.c [2021-10-13 00:30:19,806 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/data/cae76897f/5742718a12cd4cd88bf48f590f226d2f/FLAG3442f1f5c [2021-10-13 00:30:20,191 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/data/cae76897f/5742718a12cd4cd88bf48f590f226d2f [2021-10-13 00:30:20,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:30:20,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:30:20,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:30:20,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:30:20,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:30:20,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a28dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20, skipping insertion in model container [2021-10-13 00:30:20,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:30:20,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:30:20,451 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2021-10-13 00:30:20,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:30:20,462 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:30:20,495 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2021-10-13 00:30:20,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:30:20,510 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:30:20,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20 WrapperNode [2021-10-13 00:30:20,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:30:20,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:30:20,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:30:20,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:30:20,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:30:20,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:30:20,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:30:20,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:30:20,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:30:20,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:30:20,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:30:20,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:30:20,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20" (1/1) ... [2021-10-13 00:30:20,642 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:30:20,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:30:20,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:30:20,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-13 00:30:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:30:20,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:30:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:30:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:30:21,083 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:30:21,084 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-13 00:30:21,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:21 BoogieIcfgContainer [2021-10-13 00:30:21,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:30:21,091 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-13 00:30:21,091 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-13 00:30:21,095 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-13 00:30:21,097 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:30:21,098 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 12:30:20" (1/3) ... [2021-10-13 00:30:21,099 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@293a58fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:30:21, skipping insertion in model container [2021-10-13 00:30:21,100 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:30:21,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:20" (2/3) ... [2021-10-13 00:30:21,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@293a58fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:30:21, skipping insertion in model container [2021-10-13 00:30:21,101 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:30:21,101 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:21" (3/3) ... [2021-10-13 00:30:21,103 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_14-2.c [2021-10-13 00:30:21,173 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-13 00:30:21,174 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-13 00:30:21,174 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-13 00:30:21,174 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-13 00:30:21,174 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-13 00:30:21,174 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-13 00:30:21,174 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-13 00:30:21,175 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-13 00:30:21,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:21,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-10-13 00:30:21,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:21,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:21,220 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:21,220 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:21,220 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-13 00:30:21,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:21,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-10-13 00:30:21,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:21,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:21,227 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:21,227 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:21,234 INFO L791 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 35#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 32#L211true [2021-10-13 00:30:21,235 INFO L793 eck$LassoCheckResult]: Loop: 32#L211true assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 46#L55true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 23#L88true assume 0 != main_~p1~0;main_~lk1~0 := 1; 12#L88-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 33#L92-1true assume !(0 != main_~p3~0); 4#L96-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 7#L100-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 49#L104-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L108-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 52#L112-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 27#L116-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 39#L120-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 34#L124-1true assume !(0 != main_~p11~0); 17#L128-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 47#L132-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 42#L136-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 38#L140-1true assume !(0 != main_~p1~0); 18#L146-1true assume 0 != main_~p2~0; 28#L152true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 14#L151true assume !(0 != main_~p3~0); 29#L156-1true assume !(0 != main_~p4~0); 5#L161-1true assume !(0 != main_~p5~0); 11#L166-1true assume !(0 != main_~p6~0); 25#L171-1true assume !(0 != main_~p7~0); 21#L176-1true assume !(0 != main_~p8~0); 50#L181-1true assume !(0 != main_~p9~0); 22#L186-1true assume !(0 != main_~p10~0); 37#L191-1true assume !(0 != main_~p11~0); 51#L196-1true assume !(0 != main_~p12~0); 26#L201-1true assume !(0 != main_~p13~0); 15#L206-1true assume 0 != main_~p14~0; 9#L212true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 32#L211true [2021-10-13 00:30:21,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:21,241 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-13 00:30:21,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:21,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532896253] [2021-10-13 00:30:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:21,253 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:21,350 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:21,392 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:21,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1237702727, now seen corresponding path program 1 times [2021-10-13 00:30:21,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:21,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653040085] [2021-10-13 00:30:21,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:21,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:30:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:30:21,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:30:21,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653040085] [2021-10-13 00:30:21,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653040085] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:30:21,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:30:21,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:30:21,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417653690] [2021-10-13 00:30:21,492 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:30:21,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:30:21,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:30:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:30:21,511 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:30:21,547 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2021-10-13 00:30:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:30:21,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2021-10-13 00:30:21,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-10-13 00:30:21,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 139 transitions. [2021-10-13 00:30:21,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2021-10-13 00:30:21,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2021-10-13 00:30:21,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 139 transitions. [2021-10-13 00:30:21,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:30:21,565 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2021-10-13 00:30:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 139 transitions. [2021-10-13 00:30:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-10-13 00:30:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.5617977528089888) internal successors, (139), 88 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2021-10-13 00:30:21,618 INFO L704 BuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2021-10-13 00:30:21,618 INFO L587 BuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2021-10-13 00:30:21,618 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-13 00:30:21,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 139 transitions. [2021-10-13 00:30:21,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-10-13 00:30:21,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:21,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:21,622 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:21,623 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:21,623 INFO L791 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 175#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 176#L211 [2021-10-13 00:30:21,623 INFO L793 eck$LassoCheckResult]: Loop: 176#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 222#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 221#L88 assume !(0 != main_~p1~0); 220#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 219#L92-1 assume !(0 != main_~p3~0); 218#L96-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 217#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 207#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 186#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 187#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 205#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 184#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 173#L124-1 assume !(0 != main_~p11~0); 174#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 194#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 212#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 210#L140-1 assume !(0 != main_~p1~0); 211#L146-1 assume 0 != main_~p2~0; 247#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 246#L151 assume !(0 != main_~p3~0); 244#L156-1 assume !(0 != main_~p4~0); 242#L161-1 assume !(0 != main_~p5~0); 240#L166-1 assume !(0 != main_~p6~0); 237#L171-1 assume !(0 != main_~p7~0); 236#L176-1 assume !(0 != main_~p8~0); 234#L181-1 assume !(0 != main_~p9~0); 231#L186-1 assume !(0 != main_~p10~0); 230#L191-1 assume !(0 != main_~p11~0); 228#L196-1 assume !(0 != main_~p12~0); 226#L201-1 assume !(0 != main_~p13~0); 224#L206-1 assume 0 != main_~p14~0; 223#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 176#L211 [2021-10-13 00:30:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-13 00:30:21,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:21,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604192198] [2021-10-13 00:30:21,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:21,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:21,664 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:21,692 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:21,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1215070473, now seen corresponding path program 1 times [2021-10-13 00:30:21,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:21,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775493208] [2021-10-13 00:30:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:21,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:30:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:30:21,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:30:21,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775493208] [2021-10-13 00:30:21,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775493208] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:30:21,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:30:21,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:30:21,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482188613] [2021-10-13 00:30:21,778 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:30:21,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:30:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:30:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:30:21,780 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:30:21,802 INFO L93 Difference]: Finished difference Result 174 states and 270 transitions. [2021-10-13 00:30:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:30:21,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 270 transitions. [2021-10-13 00:30:21,808 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-10-13 00:30:21,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 270 transitions. [2021-10-13 00:30:21,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2021-10-13 00:30:21,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2021-10-13 00:30:21,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 270 transitions. [2021-10-13 00:30:21,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:30:21,815 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2021-10-13 00:30:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 270 transitions. [2021-10-13 00:30:21,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-10-13 00:30:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5517241379310345) internal successors, (270), 173 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 270 transitions. [2021-10-13 00:30:21,829 INFO L704 BuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2021-10-13 00:30:21,829 INFO L587 BuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2021-10-13 00:30:21,830 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-13 00:30:21,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 270 transitions. [2021-10-13 00:30:21,833 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-10-13 00:30:21,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:21,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:21,835 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:21,835 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:21,835 INFO L791 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 444#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 445#L211 [2021-10-13 00:30:21,836 INFO L793 eck$LassoCheckResult]: Loop: 445#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 504#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 502#L88 assume !(0 != main_~p1~0); 499#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 496#L92-1 assume !(0 != main_~p3~0); 492#L96-1 assume !(0 != main_~p4~0); 489#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 488#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 487#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 486#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 475#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 453#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 442#L124-1 assume !(0 != main_~p11~0); 443#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 463#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 482#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 479#L140-1 assume !(0 != main_~p1~0); 481#L146-1 assume 0 != main_~p2~0; 574#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 571#L151 assume !(0 != main_~p3~0); 568#L156-1 assume !(0 != main_~p4~0); 566#L161-1 assume !(0 != main_~p5~0); 562#L166-1 assume !(0 != main_~p6~0); 555#L171-1 assume !(0 != main_~p7~0); 552#L176-1 assume !(0 != main_~p8~0); 535#L181-1 assume !(0 != main_~p9~0); 532#L186-1 assume !(0 != main_~p10~0); 531#L191-1 assume !(0 != main_~p11~0); 529#L196-1 assume !(0 != main_~p12~0); 527#L201-1 assume !(0 != main_~p13~0); 519#L206-1 assume 0 != main_~p14~0; 518#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 445#L211 [2021-10-13 00:30:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-13 00:30:21,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:21,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154227837] [2021-10-13 00:30:21,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:21,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:21,849 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:21,870 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:21,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:21,875 INFO L82 PathProgramCache]: Analyzing trace with hash 708157561, now seen corresponding path program 1 times [2021-10-13 00:30:21,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:21,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348644541] [2021-10-13 00:30:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:21,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:30:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:30:21,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:30:21,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348644541] [2021-10-13 00:30:21,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348644541] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:30:21,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:30:21,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:30:21,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900018746] [2021-10-13 00:30:21,939 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:30:21,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:30:21,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:30:21,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:30:21,941 INFO L87 Difference]: Start difference. First operand 174 states and 270 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:30:21,963 INFO L93 Difference]: Finished difference Result 342 states and 526 transitions. [2021-10-13 00:30:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:30:21,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 526 transitions. [2021-10-13 00:30:21,970 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-10-13 00:30:21,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 526 transitions. [2021-10-13 00:30:21,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2021-10-13 00:30:21,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2021-10-13 00:30:21,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 526 transitions. [2021-10-13 00:30:21,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:30:21,979 INFO L681 BuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2021-10-13 00:30:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 526 transitions. [2021-10-13 00:30:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2021-10-13 00:30:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5380116959064327) internal successors, (526), 341 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 526 transitions. [2021-10-13 00:30:22,002 INFO L704 BuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2021-10-13 00:30:22,003 INFO L587 BuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2021-10-13 00:30:22,003 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-13 00:30:22,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 526 transitions. [2021-10-13 00:30:22,006 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-10-13 00:30:22,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:22,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:22,007 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:22,007 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:22,007 INFO L791 eck$LassoCheckResult]: Stem: 984#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 966#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 967#L211 [2021-10-13 00:30:22,008 INFO L793 eck$LassoCheckResult]: Loop: 967#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 1039#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 1035#L88 assume !(0 != main_~p1~0); 1029#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1025#L92-1 assume !(0 != main_~p3~0); 1026#L96-1 assume !(0 != main_~p4~0); 1164#L100-1 assume !(0 != main_~p5~0); 1162#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1160#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1158#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1156#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1154#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1152#L124-1 assume !(0 != main_~p11~0); 1150#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1148#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1146#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1143#L140-1 assume !(0 != main_~p1~0); 1140#L146-1 assume 0 != main_~p2~0; 1138#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1131#L151 assume !(0 != main_~p3~0); 1126#L156-1 assume !(0 != main_~p4~0); 1123#L161-1 assume !(0 != main_~p5~0); 1120#L166-1 assume !(0 != main_~p6~0); 1115#L171-1 assume !(0 != main_~p7~0); 1112#L176-1 assume !(0 != main_~p8~0); 1109#L181-1 assume !(0 != main_~p9~0); 1105#L186-1 assume !(0 != main_~p10~0); 1102#L191-1 assume !(0 != main_~p11~0); 1084#L196-1 assume !(0 != main_~p12~0); 1060#L201-1 assume !(0 != main_~p13~0); 1050#L206-1 assume 0 != main_~p14~0; 1046#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 967#L211 [2021-10-13 00:30:22,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:22,009 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-13 00:30:22,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:22,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667395624] [2021-10-13 00:30:22,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:22,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:22,032 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:22,053 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:22,059 INFO L82 PathProgramCache]: Analyzing trace with hash 770197175, now seen corresponding path program 1 times [2021-10-13 00:30:22,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:22,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580848602] [2021-10-13 00:30:22,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:22,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:30:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:30:22,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:30:22,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580848602] [2021-10-13 00:30:22,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580848602] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:30:22,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:30:22,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:30:22,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362676864] [2021-10-13 00:30:22,124 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:30:22,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:30:22,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:30:22,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:30:22,126 INFO L87 Difference]: Start difference. First operand 342 states and 526 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:30:22,158 INFO L93 Difference]: Finished difference Result 674 states and 1026 transitions. [2021-10-13 00:30:22,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:30:22,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1026 transitions. [2021-10-13 00:30:22,170 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-10-13 00:30:22,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1026 transitions. [2021-10-13 00:30:22,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2021-10-13 00:30:22,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2021-10-13 00:30:22,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1026 transitions. [2021-10-13 00:30:22,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:30:22,201 INFO L681 BuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2021-10-13 00:30:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1026 transitions. [2021-10-13 00:30:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2021-10-13 00:30:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5222551928783383) internal successors, (1026), 673 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1026 transitions. [2021-10-13 00:30:22,251 INFO L704 BuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2021-10-13 00:30:22,251 INFO L587 BuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2021-10-13 00:30:22,252 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-13 00:30:22,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1026 transitions. [2021-10-13 00:30:22,265 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-10-13 00:30:22,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:22,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:22,268 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:22,269 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:22,269 INFO L791 eck$LassoCheckResult]: Stem: 2007#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1989#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 1990#L211 [2021-10-13 00:30:22,269 INFO L793 eck$LassoCheckResult]: Loop: 1990#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 2054#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 2055#L88 assume !(0 != main_~p1~0); 2248#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2255#L92-1 assume !(0 != main_~p3~0); 2254#L96-1 assume !(0 != main_~p4~0); 2251#L100-1 assume !(0 != main_~p5~0); 2177#L104-1 assume !(0 != main_~p6~0); 2179#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2169#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2170#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2161#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2162#L124-1 assume !(0 != main_~p11~0); 2153#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2154#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2145#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2146#L140-1 assume !(0 != main_~p1~0); 2221#L146-1 assume 0 != main_~p2~0; 2218#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2215#L151 assume !(0 != main_~p3~0); 2214#L156-1 assume !(0 != main_~p4~0); 2295#L161-1 assume !(0 != main_~p5~0); 2294#L166-1 assume !(0 != main_~p6~0); 2292#L171-1 assume !(0 != main_~p7~0); 2291#L176-1 assume !(0 != main_~p8~0); 2281#L181-1 assume !(0 != main_~p9~0); 2241#L186-1 assume !(0 != main_~p10~0); 2242#L191-1 assume !(0 != main_~p11~0); 2183#L196-1 assume !(0 != main_~p12~0); 2182#L201-1 assume !(0 != main_~p13~0); 2072#L206-1 assume 0 != main_~p14~0; 2066#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 1990#L211 [2021-10-13 00:30:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:22,271 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-10-13 00:30:22,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:22,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704833378] [2021-10-13 00:30:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:22,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:22,291 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:22,303 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:22,304 INFO L82 PathProgramCache]: Analyzing trace with hash 910745785, now seen corresponding path program 1 times [2021-10-13 00:30:22,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:22,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063390299] [2021-10-13 00:30:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:22,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:30:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:30:22,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:30:22,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063390299] [2021-10-13 00:30:22,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063390299] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:30:22,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:30:22,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:30:22,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254603574] [2021-10-13 00:30:22,331 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:30:22,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:30:22,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:30:22,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:30:22,332 INFO L87 Difference]: Start difference. First operand 674 states and 1026 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:30:22,379 INFO L93 Difference]: Finished difference Result 1330 states and 2002 transitions. [2021-10-13 00:30:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:30:22,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2002 transitions. [2021-10-13 00:30:22,394 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-10-13 00:30:22,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2002 transitions. [2021-10-13 00:30:22,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2021-10-13 00:30:22,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2021-10-13 00:30:22,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2002 transitions. [2021-10-13 00:30:22,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:30:22,411 INFO L681 BuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2021-10-13 00:30:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2002 transitions. [2021-10-13 00:30:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2021-10-13 00:30:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5052631578947369) internal successors, (2002), 1329 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2002 transitions. [2021-10-13 00:30:22,448 INFO L704 BuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2021-10-13 00:30:22,448 INFO L587 BuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2021-10-13 00:30:22,448 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-13 00:30:22,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2002 transitions. [2021-10-13 00:30:22,457 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-10-13 00:30:22,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:22,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:22,458 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:22,459 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:22,459 INFO L791 eck$LassoCheckResult]: Stem: 4016#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3998#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 3999#L211 [2021-10-13 00:30:22,459 INFO L793 eck$LassoCheckResult]: Loop: 3999#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 4129#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 4125#L88 assume !(0 != main_~p1~0); 4121#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4117#L92-1 assume !(0 != main_~p3~0); 4110#L96-1 assume !(0 != main_~p4~0); 4102#L100-1 assume !(0 != main_~p5~0); 4094#L104-1 assume !(0 != main_~p6~0); 4088#L108-1 assume !(0 != main_~p7~0); 4084#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4082#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4080#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4078#L124-1 assume !(0 != main_~p11~0); 4075#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4076#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4229#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4068#L140-1 assume !(0 != main_~p1~0); 4062#L146-1 assume 0 != main_~p2~0; 4063#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4219#L151 assume !(0 != main_~p3~0); 4211#L156-1 assume !(0 != main_~p4~0); 4203#L161-1 assume !(0 != main_~p5~0); 4198#L166-1 assume !(0 != main_~p6~0); 4193#L171-1 assume !(0 != main_~p7~0); 4190#L176-1 assume !(0 != main_~p8~0); 4186#L181-1 assume !(0 != main_~p9~0); 4180#L186-1 assume !(0 != main_~p10~0); 4164#L191-1 assume !(0 != main_~p11~0); 4160#L196-1 assume !(0 != main_~p12~0); 4146#L201-1 assume !(0 != main_~p13~0); 4140#L206-1 assume 0 != main_~p14~0; 4136#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 3999#L211 [2021-10-13 00:30:22,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:22,460 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-10-13 00:30:22,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:22,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809236174] [2021-10-13 00:30:22,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:22,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:22,468 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:22,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:22,480 INFO L82 PathProgramCache]: Analyzing trace with hash 776732279, now seen corresponding path program 1 times [2021-10-13 00:30:22,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:22,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547008097] [2021-10-13 00:30:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:22,481 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:30:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:30:22,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:30:22,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547008097] [2021-10-13 00:30:22,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547008097] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:30:22,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:30:22,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:30:22,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026481641] [2021-10-13 00:30:22,512 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:30:22,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:30:22,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:30:22,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:30:22,513 INFO L87 Difference]: Start difference. First operand 1330 states and 2002 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:30:22,542 INFO L93 Difference]: Finished difference Result 2626 states and 3906 transitions. [2021-10-13 00:30:22,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:30:22,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 3906 transitions. [2021-10-13 00:30:22,577 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-10-13 00:30:22,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 3906 transitions. [2021-10-13 00:30:22,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2021-10-13 00:30:22,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2021-10-13 00:30:22,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 3906 transitions. [2021-10-13 00:30:22,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:30:22,610 INFO L681 BuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2021-10-13 00:30:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 3906 transitions. [2021-10-13 00:30:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2021-10-13 00:30:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.4874333587204875) internal successors, (3906), 2625 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3906 transitions. [2021-10-13 00:30:22,687 INFO L704 BuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2021-10-13 00:30:22,687 INFO L587 BuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2021-10-13 00:30:22,687 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-13 00:30:22,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 3906 transitions. [2021-10-13 00:30:22,708 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-10-13 00:30:22,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:22,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:22,712 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:22,712 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:22,712 INFO L791 eck$LassoCheckResult]: Stem: 7981#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7962#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 7963#L211 [2021-10-13 00:30:22,713 INFO L793 eck$LassoCheckResult]: Loop: 7963#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 8562#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 8560#L88 assume !(0 != main_~p1~0); 8559#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8368#L92-1 assume !(0 != main_~p3~0); 8369#L96-1 assume !(0 != main_~p4~0); 8542#L100-1 assume !(0 != main_~p5~0); 8538#L104-1 assume !(0 != main_~p6~0); 8534#L108-1 assume !(0 != main_~p7~0); 8530#L112-1 assume !(0 != main_~p8~0); 8528#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8480#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8481#L124-1 assume !(0 != main_~p11~0); 8472#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8473#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8463#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8464#L140-1 assume !(0 != main_~p1~0); 8526#L146-1 assume 0 != main_~p2~0; 8525#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8491#L151 assume !(0 != main_~p3~0); 8489#L156-1 assume !(0 != main_~p4~0); 8245#L161-1 assume !(0 != main_~p5~0); 8240#L166-1 assume !(0 != main_~p6~0); 8241#L171-1 assume !(0 != main_~p7~0); 8587#L176-1 assume !(0 != main_~p8~0); 8585#L181-1 assume !(0 != main_~p9~0); 8582#L186-1 assume !(0 != main_~p10~0); 8581#L191-1 assume !(0 != main_~p11~0); 8570#L196-1 assume !(0 != main_~p12~0); 8566#L201-1 assume !(0 != main_~p13~0); 8564#L206-1 assume 0 != main_~p14~0; 8563#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 7963#L211 [2021-10-13 00:30:22,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-10-13 00:30:22,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:22,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292278074] [2021-10-13 00:30:22,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:22,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:22,731 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:22,752 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:22,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1028706055, now seen corresponding path program 1 times [2021-10-13 00:30:22,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:22,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304846263] [2021-10-13 00:30:22,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:22,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:30:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:30:22,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:30:22,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304846263] [2021-10-13 00:30:22,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304846263] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:30:22,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:30:22,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:30:22,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475977988] [2021-10-13 00:30:22,799 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:30:22,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:30:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:30:22,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:30:22,800 INFO L87 Difference]: Start difference. First operand 2626 states and 3906 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:30:22,843 INFO L93 Difference]: Finished difference Result 5186 states and 7618 transitions. [2021-10-13 00:30:22,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:30:22,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7618 transitions. [2021-10-13 00:30:22,894 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-10-13 00:30:22,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7618 transitions. [2021-10-13 00:30:22,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2021-10-13 00:30:22,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2021-10-13 00:30:22,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7618 transitions. [2021-10-13 00:30:22,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:30:22,957 INFO L681 BuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2021-10-13 00:30:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7618 transitions. [2021-10-13 00:30:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2021-10-13 00:30:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.4689548785190898) internal successors, (7618), 5185 states have internal predecessors, (7618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7618 transitions. [2021-10-13 00:30:23,151 INFO L704 BuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2021-10-13 00:30:23,151 INFO L587 BuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2021-10-13 00:30:23,151 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-13 00:30:23,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7618 transitions. [2021-10-13 00:30:23,177 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-10-13 00:30:23,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:23,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:23,178 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:23,178 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:23,178 INFO L791 eck$LassoCheckResult]: Stem: 15797#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 15778#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 15779#L211 [2021-10-13 00:30:23,178 INFO L793 eck$LassoCheckResult]: Loop: 15779#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 16492#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 16493#L88 assume !(0 != main_~p1~0); 16478#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 16479#L92-1 assume !(0 != main_~p3~0); 16474#L96-1 assume !(0 != main_~p4~0); 16475#L100-1 assume !(0 != main_~p5~0); 16603#L104-1 assume !(0 != main_~p6~0); 16600#L108-1 assume !(0 != main_~p7~0); 16595#L112-1 assume !(0 != main_~p8~0); 16585#L116-1 assume !(0 != main_~p9~0); 16584#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 16583#L124-1 assume !(0 != main_~p11~0); 16582#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 16316#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 16317#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 16297#L140-1 assume !(0 != main_~p1~0); 16299#L146-1 assume 0 != main_~p2~0; 16208#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 16209#L151 assume !(0 != main_~p3~0); 16198#L156-1 assume !(0 != main_~p4~0); 16199#L161-1 assume !(0 != main_~p5~0); 16188#L166-1 assume !(0 != main_~p6~0); 16189#L171-1 assume !(0 != main_~p7~0); 16575#L176-1 assume !(0 != main_~p8~0); 16627#L181-1 assume !(0 != main_~p9~0); 16625#L186-1 assume !(0 != main_~p10~0); 16624#L191-1 assume !(0 != main_~p11~0); 16622#L196-1 assume !(0 != main_~p12~0); 16521#L201-1 assume !(0 != main_~p13~0); 16520#L206-1 assume 0 != main_~p14~0; 16508#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 15779#L211 [2021-10-13 00:30:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-10-13 00:30:23,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:23,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347125297] [2021-10-13 00:30:23,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:23,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:23,186 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:23,195 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash -809851337, now seen corresponding path program 1 times [2021-10-13 00:30:23,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:23,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115749447] [2021-10-13 00:30:23,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:23,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:30:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:30:23,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:30:23,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115749447] [2021-10-13 00:30:23,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115749447] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:30:23,264 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:30:23,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:30:23,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065789597] [2021-10-13 00:30:23,264 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:30:23,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:30:23,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:30:23,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:30:23,267 INFO L87 Difference]: Start difference. First operand 5186 states and 7618 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:30:23,329 INFO L93 Difference]: Finished difference Result 10242 states and 14850 transitions. [2021-10-13 00:30:23,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:30:23,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 14850 transitions. [2021-10-13 00:30:23,414 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-10-13 00:30:23,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 14850 transitions. [2021-10-13 00:30:23,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2021-10-13 00:30:23,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2021-10-13 00:30:23,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 14850 transitions. [2021-10-13 00:30:23,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:30:23,549 INFO L681 BuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2021-10-13 00:30:23,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 14850 transitions. [2021-10-13 00:30:23,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2021-10-13 00:30:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4499121265377857) internal successors, (14850), 10241 states have internal predecessors, (14850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 14850 transitions. [2021-10-13 00:30:23,940 INFO L704 BuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2021-10-13 00:30:23,940 INFO L587 BuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2021-10-13 00:30:23,940 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-13 00:30:23,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 14850 transitions. [2021-10-13 00:30:23,990 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-10-13 00:30:23,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:23,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:23,991 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:23,991 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:23,991 INFO L791 eck$LassoCheckResult]: Stem: 31232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 31212#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 31213#L211 [2021-10-13 00:30:23,993 INFO L793 eck$LassoCheckResult]: Loop: 31213#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 31584#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 31585#L88 assume !(0 != main_~p1~0); 31684#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 31683#L92-1 assume !(0 != main_~p3~0); 31681#L96-1 assume !(0 != main_~p4~0); 31679#L100-1 assume !(0 != main_~p5~0); 31677#L104-1 assume !(0 != main_~p6~0); 31675#L108-1 assume !(0 != main_~p7~0); 31671#L112-1 assume !(0 != main_~p8~0); 31667#L116-1 assume !(0 != main_~p9~0); 31664#L120-1 assume !(0 != main_~p10~0); 31662#L124-1 assume !(0 != main_~p11~0); 31660#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 31658#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 31656#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 31654#L140-1 assume !(0 != main_~p1~0); 31652#L146-1 assume 0 != main_~p2~0; 31650#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 31647#L151 assume !(0 != main_~p3~0); 31642#L156-1 assume !(0 != main_~p4~0); 31638#L161-1 assume !(0 != main_~p5~0); 31634#L166-1 assume !(0 != main_~p6~0); 31630#L171-1 assume !(0 != main_~p7~0); 31626#L176-1 assume !(0 != main_~p8~0); 31622#L181-1 assume !(0 != main_~p9~0); 31623#L186-1 assume !(0 != main_~p10~0); 31614#L191-1 assume !(0 != main_~p11~0); 31613#L196-1 assume !(0 != main_~p12~0); 31602#L201-1 assume !(0 != main_~p13~0); 31601#L206-1 assume 0 != main_~p14~0; 31592#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 31213#L211 [2021-10-13 00:30:23,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:23,994 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-10-13 00:30:23,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:23,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318004737] [2021-10-13 00:30:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:23,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:24,006 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:24,019 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:24,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:24,020 INFO L82 PathProgramCache]: Analyzing trace with hash -387149511, now seen corresponding path program 1 times [2021-10-13 00:30:24,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:24,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24549921] [2021-10-13 00:30:24,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:24,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:30:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:30:24,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:30:24,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24549921] [2021-10-13 00:30:24,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24549921] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:30:24,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:30:24,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:30:24,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043836191] [2021-10-13 00:30:24,066 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:30:24,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:30:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:30:24,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:30:24,069 INFO L87 Difference]: Start difference. First operand 10242 states and 14850 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:30:24,265 INFO L93 Difference]: Finished difference Result 20226 states and 28930 transitions. [2021-10-13 00:30:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:30:24,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 28930 transitions. [2021-10-13 00:30:24,382 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-10-13 00:30:24,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 28930 transitions. [2021-10-13 00:30:24,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2021-10-13 00:30:24,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2021-10-13 00:30:24,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 28930 transitions. [2021-10-13 00:30:24,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:30:24,580 INFO L681 BuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2021-10-13 00:30:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 28930 transitions. [2021-10-13 00:30:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2021-10-13 00:30:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.43033718975576) internal successors, (28930), 20225 states have internal predecessors, (28930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 28930 transitions. [2021-10-13 00:30:24,991 INFO L704 BuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2021-10-13 00:30:24,991 INFO L587 BuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2021-10-13 00:30:24,991 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-13 00:30:24,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 28930 transitions. [2021-10-13 00:30:25,081 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-10-13 00:30:25,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:25,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:25,083 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:25,083 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:25,083 INFO L791 eck$LassoCheckResult]: Stem: 61707#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 61687#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 61688#L211 [2021-10-13 00:30:25,083 INFO L793 eck$LassoCheckResult]: Loop: 61688#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 61838#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 61836#L88 assume !(0 != main_~p1~0); 61834#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 61832#L92-1 assume !(0 != main_~p3~0); 61828#L96-1 assume !(0 != main_~p4~0); 61824#L100-1 assume !(0 != main_~p5~0); 61820#L104-1 assume !(0 != main_~p6~0); 61816#L108-1 assume !(0 != main_~p7~0); 61812#L112-1 assume !(0 != main_~p8~0); 61808#L116-1 assume !(0 != main_~p9~0); 61804#L120-1 assume !(0 != main_~p10~0); 61802#L124-1 assume !(0 != main_~p11~0); 61798#L128-1 assume !(0 != main_~p12~0); 61796#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 61794#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 61792#L140-1 assume !(0 != main_~p1~0); 61787#L146-1 assume 0 != main_~p2~0; 61784#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 61780#L151 assume !(0 != main_~p3~0); 61779#L156-1 assume !(0 != main_~p4~0); 61877#L161-1 assume !(0 != main_~p5~0); 61873#L166-1 assume !(0 != main_~p6~0); 61869#L171-1 assume !(0 != main_~p7~0); 61865#L176-1 assume !(0 != main_~p8~0); 61861#L181-1 assume !(0 != main_~p9~0); 61857#L186-1 assume !(0 != main_~p10~0); 61854#L191-1 assume !(0 != main_~p11~0); 61849#L196-1 assume !(0 != main_~p12~0); 61846#L201-1 assume !(0 != main_~p13~0); 61843#L206-1 assume 0 != main_~p14~0; 61841#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 61688#L211 [2021-10-13 00:30:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:25,084 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-10-13 00:30:25,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:25,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882790012] [2021-10-13 00:30:25,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:25,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:25,092 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:25,101 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:25,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:25,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2076093253, now seen corresponding path program 1 times [2021-10-13 00:30:25,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:25,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454700206] [2021-10-13 00:30:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:25,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:30:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:30:25,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:30:25,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454700206] [2021-10-13 00:30:25,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454700206] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:30:25,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:30:25,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:30:25,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114586775] [2021-10-13 00:30:25,133 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:30:25,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:30:25,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:30:25,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:30:25,135 INFO L87 Difference]: Start difference. First operand 20226 states and 28930 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:30:25,422 INFO L93 Difference]: Finished difference Result 39938 states and 56322 transitions. [2021-10-13 00:30:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:30:25,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 56322 transitions. [2021-10-13 00:30:25,804 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-10-13 00:30:25,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 56322 transitions. [2021-10-13 00:30:25,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2021-10-13 00:30:25,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2021-10-13 00:30:25,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 56322 transitions. [2021-10-13 00:30:25,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:30:25,982 INFO L681 BuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2021-10-13 00:30:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 56322 transitions. [2021-10-13 00:30:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2021-10-13 00:30:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4102358655916671) internal successors, (56322), 39937 states have internal predecessors, (56322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:30:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 56322 transitions. [2021-10-13 00:30:26,771 INFO L704 BuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2021-10-13 00:30:26,771 INFO L587 BuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2021-10-13 00:30:26,771 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-13 00:30:26,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 56322 transitions. [2021-10-13 00:30:26,927 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-10-13 00:30:26,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:30:26,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:30:26,929 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:30:26,929 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:30:26,930 INFO L791 eck$LassoCheckResult]: Stem: 121873#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 121856#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 121857#L211 [2021-10-13 00:30:26,930 INFO L793 eck$LassoCheckResult]: Loop: 121857#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 122287#L55 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 122283#L88 assume !(0 != main_~p1~0); 122281#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 122279#L92-1 assume !(0 != main_~p3~0); 122275#L96-1 assume !(0 != main_~p4~0); 122271#L100-1 assume !(0 != main_~p5~0); 122267#L104-1 assume !(0 != main_~p6~0); 122263#L108-1 assume !(0 != main_~p7~0); 122259#L112-1 assume !(0 != main_~p8~0); 122255#L116-1 assume !(0 != main_~p9~0); 122251#L120-1 assume !(0 != main_~p10~0); 122249#L124-1 assume !(0 != main_~p11~0); 122246#L128-1 assume !(0 != main_~p12~0); 122247#L132-1 assume !(0 != main_~p13~0); 122340#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 122337#L140-1 assume !(0 != main_~p1~0); 122335#L146-1 assume 0 != main_~p2~0; 122332#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 122329#L151 assume !(0 != main_~p3~0); 122324#L156-1 assume !(0 != main_~p4~0); 122320#L161-1 assume !(0 != main_~p5~0); 122316#L166-1 assume !(0 != main_~p6~0); 122312#L171-1 assume !(0 != main_~p7~0); 122308#L176-1 assume !(0 != main_~p8~0); 122304#L181-1 assume !(0 != main_~p9~0); 122300#L186-1 assume !(0 != main_~p10~0); 122298#L191-1 assume !(0 != main_~p11~0); 122296#L196-1 assume !(0 != main_~p12~0); 122294#L201-1 assume !(0 != main_~p13~0); 122292#L206-1 assume 0 != main_~p14~0; 122290#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 121857#L211 [2021-10-13 00:30:26,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:26,931 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-10-13 00:30:26,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:26,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262355202] [2021-10-13 00:30:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:26,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:26,941 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:26,965 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:26,967 INFO L82 PathProgramCache]: Analyzing trace with hash 224729337, now seen corresponding path program 1 times [2021-10-13 00:30:26,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:26,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819560842] [2021-10-13 00:30:26,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:26,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:26,983 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:26,997 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:30:26,998 INFO L82 PathProgramCache]: Analyzing trace with hash -233466693, now seen corresponding path program 1 times [2021-10-13 00:30:26,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:30:27,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359562703] [2021-10-13 00:30:27,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:30:27,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:30:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:27,160 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:30:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:30:27,215 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:30:28,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 12:30:28 BoogieIcfgContainer [2021-10-13 00:30:28,116 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-13 00:30:28,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:30:28,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:30:28,117 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:30:28,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:21" (3/4) ... [2021-10-13 00:30:28,120 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-13 00:30:28,182 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:30:28,182 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:30:28,184 INFO L168 Benchmark]: Toolchain (without parser) took 7984.31 ms. Allocated memory was 92.3 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 58.6 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 324.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:30:28,185 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 92.3 MB. Free memory is still 49.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:30:28,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.26 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 58.4 MB in the beginning and 85.5 MB in the end (delta: -27.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:30:28,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.10 ms. Allocated memory is still 111.1 MB. Free memory was 85.5 MB in the beginning and 83.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:30:28,186 INFO L168 Benchmark]: Boogie Preprocessor took 25.99 ms. Allocated memory is still 111.1 MB. Free memory was 83.4 MB in the beginning and 82.4 MB in the end (delta: 999.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:30:28,187 INFO L168 Benchmark]: RCFGBuilder took 474.00 ms. Allocated memory is still 111.1 MB. Free memory was 81.9 MB in the beginning and 69.2 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 00:30:28,188 INFO L168 Benchmark]: BuchiAutomizer took 7025.46 ms. Allocated memory was 111.1 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 69.2 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 317.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:30:28,188 INFO L168 Benchmark]: Witness Printer took 65.52 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:30:28,190 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 92.3 MB. Free memory is still 49.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 309.26 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 58.4 MB in the beginning and 85.5 MB in the end (delta: -27.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 77.10 ms. Allocated memory is still 111.1 MB. Free memory was 85.5 MB in the beginning and 83.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.99 ms. Allocated memory is still 111.1 MB. Free memory was 83.4 MB in the beginning and 82.4 MB in the end (delta: 999.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 474.00 ms. Allocated memory is still 111.1 MB. Free memory was 81.9 MB in the beginning and 69.2 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 7025.46 ms. Allocated memory was 111.1 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 69.2 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 317.4 MB. Max. memory is 16.1 GB. * Witness Printer took 65.52 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 39938 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 2023.3ms AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.2s Buchi closure took 0.0s. Biggest automaton had 39938 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1083 SDtfs, 551 SDslu, 679 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 77.4ms Time LassoAnalysisResults: nont1 unkn0 SFLI10 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: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=30087} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=30087, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c57d8af=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@512eceed=0, p14=11, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b139fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@289b2a29=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75d9c8be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78d6501d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37c1fdd1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6bb8a784=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@195898fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e26649c=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=30088, \result=0, p2=13, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@727df323=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25c87829=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22efc944=0, lk13=0, p13=0, p11=0, lk11=0, cond=10, NULL=30089, NULL=0, NULL=30090, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@77a7e822=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69c5e9d=10, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: 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; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND TRUE p2 != 0 [L93] lk2 = 1 [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND TRUE p14 != 0 [L141] lk14 = 1 [L146] COND FALSE !(p1 != 0) [L151] COND TRUE p2 != 0 [L152] COND FALSE !(lk2 != 1) [L153] lk2 = 0 [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND TRUE p14 != 0 [L212] COND FALSE !(lk14 != 1) [L213] lk14 = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-13 00:30:28,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8726335c-3ef3-4cef-9eac-034dd1e8530e/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...