./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_11.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_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/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_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/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_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/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 a93221bc263791497331acd2a7a0150037c621aa ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:02:54,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:02:54,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:02:54,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:02:54,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:02:54,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:02:54,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:02:54,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:02:54,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:02:54,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:02:54,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:02:54,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:02:54,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:02:54,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:02:54,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:02:54,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:02:54,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:02:54,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:02:54,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:02:54,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:02:54,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:02:54,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:02:54,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:02:54,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:02:54,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:02:54,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:02:54,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:02:54,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:02:54,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:02:54,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:02:54,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:02:54,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:02:54,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:02:54,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:02:54,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:02:54,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:02:54,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:02:54,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:02:54,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:02:54,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:02:54,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:02:54,425 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-13 01:02:54,476 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:02:54,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:02:54,477 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:02:54,477 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:02:54,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:02:54,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:02:54,479 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:02:54,480 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-13 01:02:54,480 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-13 01:02:54,480 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-13 01:02:54,481 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-13 01:02:54,481 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-13 01:02:54,481 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-13 01:02:54,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:02:54,482 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:02:54,482 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 01:02:54,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:02:54,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:02:54,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:02:54,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-13 01:02:54,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-13 01:02:54,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-13 01:02:54,483 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:02:54,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:02:54,484 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-13 01:02:54,484 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:02:54,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-13 01:02:54,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:02:54,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:02:54,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:02:54,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:02:54,487 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:02:54,488 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-13 01:02:54,488 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_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/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_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/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 -> a93221bc263791497331acd2a7a0150037c621aa [2021-10-13 01:02:54,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:02:54,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:02:54,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:02:54,792 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:02:54,793 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:02:54,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/locks/test_locks_11.c [2021-10-13 01:02:54,887 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/data/30e23e08b/a78773de1ef2409393c9436081416be2/FLAG59bbcd0fc [2021-10-13 01:02:55,374 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:02:55,375 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/sv-benchmarks/c/locks/test_locks_11.c [2021-10-13 01:02:55,383 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/data/30e23e08b/a78773de1ef2409393c9436081416be2/FLAG59bbcd0fc [2021-10-13 01:02:55,731 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/data/30e23e08b/a78773de1ef2409393c9436081416be2 [2021-10-13 01:02:55,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:02:55,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:02:55,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:02:55,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:02:55,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:02:55,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:02:55" (1/1) ... [2021-10-13 01:02:55,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3707cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:55, skipping insertion in model container [2021-10-13 01:02:55,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:02:55" (1/1) ... [2021-10-13 01:02:55,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:02:55,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:02:55,959 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_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2021-10-13 01:02:55,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:02:55,969 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:02:55,992 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_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2021-10-13 01:02:55,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:02:56,006 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:02:56,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56 WrapperNode [2021-10-13 01:02:56,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:02:56,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:02:56,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:02:56,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:02:56,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56" (1/1) ... [2021-10-13 01:02:56,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56" (1/1) ... [2021-10-13 01:02:56,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:02:56,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:02:56,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:02:56,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:02:56,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56" (1/1) ... [2021-10-13 01:02:56,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56" (1/1) ... [2021-10-13 01:02:56,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56" (1/1) ... [2021-10-13 01:02:56,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56" (1/1) ... [2021-10-13 01:02:56,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56" (1/1) ... [2021-10-13 01:02:56,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56" (1/1) ... [2021-10-13 01:02:56,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56" (1/1) ... [2021-10-13 01:02:56,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:02:56,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:02:56,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:02:56,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:02:56,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56" (1/1) ... [2021-10-13 01:02:56,093 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 01:02:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:56,115 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 01:02:56,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-13 01:02:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:02:56,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:02:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:02:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:02:56,434 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:02:56,434 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-13 01:02:56,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:02:56 BoogieIcfgContainer [2021-10-13 01:02:56,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:02:56,437 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-13 01:02:56,437 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-13 01:02:56,447 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-13 01:02:56,448 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 01:02:56,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 01:02:55" (1/3) ... [2021-10-13 01:02:56,450 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@466dc585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 01:02:56, skipping insertion in model container [2021-10-13 01:02:56,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 01:02:56,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:56" (2/3) ... [2021-10-13 01:02:56,450 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@466dc585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 01:02:56, skipping insertion in model container [2021-10-13 01:02:56,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 01:02:56,451 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:02:56" (3/3) ... [2021-10-13 01:02:56,452 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2021-10-13 01:02:56,512 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-13 01:02:56,514 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-13 01:02:56,514 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-13 01:02:56,514 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-13 01:02:56,514 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-13 01:02:56,515 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-13 01:02:56,515 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-13 01:02:56,515 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-13 01:02:56,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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 01:02:56,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-10-13 01:02:56,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:02:56,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:02:56,576 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:02:56,577 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:56,577 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-13 01:02:56,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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 01:02:56,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-10-13 01:02:56,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:02:56,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:02:56,583 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:02:56,583 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:56,589 INFO L791 eck$LassoCheckResult]: Stem: 24#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10#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_~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_~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;havoc main_~cond~0; 28#L169-1true [2021-10-13 01:02:56,590 INFO L793 eck$LassoCheckResult]: Loop: 28#L169-1true assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 15#L46true 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; 41#L73true assume 0 != main_~p1~0;main_~lk1~0 := 1; 42#L73-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 29#L77-1true assume !(0 != main_~p3~0); 6#L81-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 25#L85-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 19#L89-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L93-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 22#L97-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 30#L101-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 36#L105-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 26#L109-1true assume !(0 != main_~p11~0); 21#L113-1true assume !(0 != main_~p1~0); 37#L119-1true assume !(0 != main_~p2~0); 9#L124-1true assume !(0 != main_~p3~0); 12#L129-1true assume !(0 != main_~p4~0); 20#L134-1true assume !(0 != main_~p5~0); 11#L139-1true assume !(0 != main_~p6~0); 4#L144-1true assume !(0 != main_~p7~0); 35#L149-1true assume !(0 != main_~p8~0); 18#L154-1true assume !(0 != main_~p9~0); 8#L159-1true assume !(0 != main_~p10~0); 39#L164-1true assume !(0 != main_~p11~0); 28#L169-1true [2021-10-13 01:02:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:56,596 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-13 01:02:56,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:56,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830384548] [2021-10-13 01:02:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:56,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:56,694 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:02:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:56,757 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:02:56,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:56,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2021-10-13 01:02:56,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:56,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371045923] [2021-10-13 01:02:56,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:56,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:56,935 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 01:02:56,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:56,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371045923] [2021-10-13 01:02:56,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371045923] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:56,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:56,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:56,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939154104] [2021-10-13 01:02:56,944 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:02:56,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:56,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:56,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:56,974 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:57,046 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2021-10-13 01:02:57,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:57,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 142 transitions. [2021-10-13 01:02:57,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2021-10-13 01:02:57,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 113 transitions. [2021-10-13 01:02:57,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-10-13 01:02:57,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-10-13 01:02:57,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2021-10-13 01:02:57,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:02:57,075 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2021-10-13 01:02:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2021-10-13 01:02:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-10-13 01:02:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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 01:02:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2021-10-13 01:02:57,112 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2021-10-13 01:02:57,113 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2021-10-13 01:02:57,113 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-13 01:02:57,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2021-10-13 01:02:57,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2021-10-13 01:02:57,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:02:57,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:02:57,119 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:02:57,119 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:57,119 INFO L791 eck$LassoCheckResult]: Stem: 164#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 145#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_~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_~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;havoc main_~cond~0; 146#L169-1 [2021-10-13 01:02:57,120 INFO L793 eck$LassoCheckResult]: Loop: 146#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 179#L46 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; 178#L73 assume !(0 != main_~p1~0); 174#L73-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 168#L77-1 assume !(0 != main_~p3~0); 135#L81-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 136#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 159#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 149#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 150#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 169#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 170#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 177#L109-1 assume !(0 != main_~p11~0); 175#L113-1 assume !(0 != main_~p1~0); 176#L119-1 assume !(0 != main_~p2~0); 196#L124-1 assume !(0 != main_~p3~0); 194#L129-1 assume !(0 != main_~p4~0); 192#L134-1 assume !(0 != main_~p5~0); 190#L139-1 assume !(0 != main_~p6~0); 188#L144-1 assume !(0 != main_~p7~0); 186#L149-1 assume !(0 != main_~p8~0); 157#L154-1 assume !(0 != main_~p9~0); 139#L159-1 assume !(0 != main_~p10~0); 141#L164-1 assume !(0 != main_~p11~0); 146#L169-1 [2021-10-13 01:02:57,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,123 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-13 01:02:57,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568712516] [2021-10-13 01:02:57,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,158 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:02:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,193 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:02:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2021-10-13 01:02:57,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920900420] [2021-10-13 01:02:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:57,227 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 01:02:57,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:57,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920900420] [2021-10-13 01:02:57,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920900420] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:57,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:57,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:57,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274340211] [2021-10-13 01:02:57,229 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:02:57,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:57,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:57,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:57,231 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:57,258 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2021-10-13 01:02:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:57,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2021-10-13 01:02:57,263 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2021-10-13 01:02:57,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2021-10-13 01:02:57,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2021-10-13 01:02:57,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2021-10-13 01:02:57,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2021-10-13 01:02:57,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:02:57,267 INFO L681 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2021-10-13 01:02:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2021-10-13 01:02:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-10-13 01:02:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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 01:02:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2021-10-13 01:02:57,298 INFO L704 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2021-10-13 01:02:57,298 INFO L587 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2021-10-13 01:02:57,298 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-13 01:02:57,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2021-10-13 01:02:57,301 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2021-10-13 01:02:57,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:02:57,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:02:57,302 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:02:57,302 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:57,302 INFO L791 eck$LassoCheckResult]: Stem: 379#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 360#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_~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_~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;havoc main_~cond~0; 361#L169-1 [2021-10-13 01:02:57,302 INFO L793 eck$LassoCheckResult]: Loop: 361#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 369#L46 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; 370#L73 assume !(0 != main_~p1~0); 425#L73-2 assume !(0 != main_~p2~0); 424#L77-1 assume !(0 != main_~p3~0); 421#L81-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 418#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 415#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 412#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 409#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 406#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 404#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 395#L109-1 assume !(0 != main_~p11~0); 396#L113-1 assume !(0 != main_~p1~0); 400#L119-1 assume !(0 != main_~p2~0); 357#L124-1 assume !(0 != main_~p3~0); 358#L129-1 assume !(0 != main_~p4~0); 353#L134-1 assume !(0 != main_~p5~0); 362#L139-1 assume !(0 != main_~p6~0); 363#L144-1 assume !(0 != main_~p7~0); 456#L149-1 assume !(0 != main_~p8~0); 454#L154-1 assume !(0 != main_~p9~0); 452#L159-1 assume !(0 != main_~p10~0); 388#L164-1 assume !(0 != main_~p11~0); 361#L169-1 [2021-10-13 01:02:57,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,303 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-13 01:02:57,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089814660] [2021-10-13 01:02:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,332 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:02:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,366 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:02:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2021-10-13 01:02:57,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375164761] [2021-10-13 01:02:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:57,427 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 01:02:57,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:57,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375164761] [2021-10-13 01:02:57,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375164761] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:57,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:57,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:57,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398049718] [2021-10-13 01:02:57,429 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:02:57,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:57,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:57,431 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:57,459 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2021-10-13 01:02:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:57,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2021-10-13 01:02:57,466 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2021-10-13 01:02:57,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2021-10-13 01:02:57,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2021-10-13 01:02:57,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2021-10-13 01:02:57,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2021-10-13 01:02:57,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:02:57,485 INFO L681 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2021-10-13 01:02:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2021-10-13 01:02:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-13 01:02:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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 01:02:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2021-10-13 01:02:57,500 INFO L704 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2021-10-13 01:02:57,500 INFO L587 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2021-10-13 01:02:57,500 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-13 01:02:57,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2021-10-13 01:02:57,502 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2021-10-13 01:02:57,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:02:57,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:02:57,503 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:02:57,503 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:57,504 INFO L791 eck$LassoCheckResult]: Stem: 793#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 774#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_~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_~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;havoc main_~cond~0; 775#L169-1 [2021-10-13 01:02:57,504 INFO L793 eck$LassoCheckResult]: Loop: 775#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 917#L46 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; 916#L73 assume !(0 != main_~p1~0); 914#L73-2 assume !(0 != main_~p2~0); 910#L77-1 assume !(0 != main_~p3~0); 906#L81-1 assume !(0 != main_~p4~0); 902#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 898#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 894#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 890#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 886#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 882#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 878#L109-1 assume !(0 != main_~p11~0); 872#L113-1 assume !(0 != main_~p1~0); 873#L119-1 assume !(0 != main_~p2~0); 940#L124-1 assume !(0 != main_~p3~0); 937#L129-1 assume !(0 != main_~p4~0); 936#L134-1 assume !(0 != main_~p5~0); 933#L139-1 assume !(0 != main_~p6~0); 848#L144-1 assume !(0 != main_~p7~0); 843#L149-1 assume !(0 != main_~p8~0); 842#L154-1 assume !(0 != main_~p9~0); 831#L159-1 assume !(0 != main_~p10~0); 830#L164-1 assume !(0 != main_~p11~0); 775#L169-1 [2021-10-13 01:02:57,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,504 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-13 01:02:57,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401888869] [2021-10-13 01:02:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,514 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:02:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,525 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:02:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2021-10-13 01:02:57,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264694474] [2021-10-13 01:02:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:57,551 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 01:02:57,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:57,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264694474] [2021-10-13 01:02:57,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264694474] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:57,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:57,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:57,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318332406] [2021-10-13 01:02:57,553 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:02:57,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:57,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:57,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:57,554 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:57,568 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2021-10-13 01:02:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:57,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2021-10-13 01:02:57,574 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2021-10-13 01:02:57,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2021-10-13 01:02:57,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2021-10-13 01:02:57,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2021-10-13 01:02:57,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2021-10-13 01:02:57,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:02:57,582 INFO L681 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2021-10-13 01:02:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2021-10-13 01:02:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-10-13 01:02:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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 01:02:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2021-10-13 01:02:57,623 INFO L704 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2021-10-13 01:02:57,626 INFO L587 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2021-10-13 01:02:57,626 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-13 01:02:57,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2021-10-13 01:02:57,631 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2021-10-13 01:02:57,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:02:57,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:02:57,632 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:02:57,632 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:57,632 INFO L791 eck$LassoCheckResult]: Stem: 1600#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1580#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_~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_~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;havoc main_~cond~0; 1581#L169-1 [2021-10-13 01:02:57,632 INFO L793 eck$LassoCheckResult]: Loop: 1581#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 1663#L46 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; 1661#L73 assume !(0 != main_~p1~0); 1657#L73-2 assume !(0 != main_~p2~0); 1655#L77-1 assume !(0 != main_~p3~0); 1651#L81-1 assume !(0 != main_~p4~0); 1647#L85-1 assume !(0 != main_~p5~0); 1645#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1643#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1641#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1639#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1637#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1635#L109-1 assume !(0 != main_~p11~0); 1632#L113-1 assume !(0 != main_~p1~0); 1633#L119-1 assume !(0 != main_~p2~0); 1699#L124-1 assume !(0 != main_~p3~0); 1694#L129-1 assume !(0 != main_~p4~0); 1690#L134-1 assume !(0 != main_~p5~0); 1687#L139-1 assume !(0 != main_~p6~0); 1683#L144-1 assume !(0 != main_~p7~0); 1679#L149-1 assume !(0 != main_~p8~0); 1675#L154-1 assume !(0 != main_~p9~0); 1671#L159-1 assume !(0 != main_~p10~0); 1667#L164-1 assume !(0 != main_~p11~0); 1581#L169-1 [2021-10-13 01:02:57,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,633 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-10-13 01:02:57,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474914920] [2021-10-13 01:02:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,642 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:02:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,653 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:02:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2021-10-13 01:02:57,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197972675] [2021-10-13 01:02:57,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:57,677 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 01:02:57,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:57,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197972675] [2021-10-13 01:02:57,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197972675] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:57,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:57,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:57,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905380831] [2021-10-13 01:02:57,679 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:02:57,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:57,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:57,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:57,680 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:57,696 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2021-10-13 01:02:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:57,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2021-10-13 01:02:57,706 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2021-10-13 01:02:57,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2021-10-13 01:02:57,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2021-10-13 01:02:57,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2021-10-13 01:02:57,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2021-10-13 01:02:57,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:02:57,719 INFO L681 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2021-10-13 01:02:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2021-10-13 01:02:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2021-10-13 01:02:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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 01:02:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2021-10-13 01:02:57,744 INFO L704 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2021-10-13 01:02:57,744 INFO L587 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2021-10-13 01:02:57,744 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-13 01:02:57,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2021-10-13 01:02:57,751 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2021-10-13 01:02:57,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:02:57,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:02:57,752 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:02:57,752 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:57,752 INFO L791 eck$LassoCheckResult]: Stem: 3176#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3158#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_~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_~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;havoc main_~cond~0; 3159#L169-1 [2021-10-13 01:02:57,752 INFO L793 eck$LassoCheckResult]: Loop: 3159#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 3298#L46 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; 3294#L73 assume !(0 != main_~p1~0); 3290#L73-2 assume !(0 != main_~p2~0); 3288#L77-1 assume !(0 != main_~p3~0); 3286#L81-1 assume !(0 != main_~p4~0); 3282#L85-1 assume !(0 != main_~p5~0); 3278#L89-1 assume !(0 != main_~p6~0); 3276#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3274#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3272#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3270#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3268#L109-1 assume !(0 != main_~p11~0); 3264#L113-1 assume !(0 != main_~p1~0); 3260#L119-1 assume !(0 != main_~p2~0); 3257#L124-1 assume !(0 != main_~p3~0); 3253#L129-1 assume !(0 != main_~p4~0); 3254#L134-1 assume !(0 != main_~p5~0); 3321#L139-1 assume !(0 != main_~p6~0); 3318#L144-1 assume !(0 != main_~p7~0); 3314#L149-1 assume !(0 != main_~p8~0); 3310#L154-1 assume !(0 != main_~p9~0); 3306#L159-1 assume !(0 != main_~p10~0); 3302#L164-1 assume !(0 != main_~p11~0); 3159#L169-1 [2021-10-13 01:02:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,753 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-10-13 01:02:57,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499966361] [2021-10-13 01:02:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,760 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:02:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,770 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:02:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2021-10-13 01:02:57,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912490213] [2021-10-13 01:02:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:57,792 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 01:02:57,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:57,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912490213] [2021-10-13 01:02:57,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912490213] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:57,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:57,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:57,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771552328] [2021-10-13 01:02:57,793 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:02:57,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:57,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:57,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:57,794 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:57,815 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2021-10-13 01:02:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:57,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2021-10-13 01:02:57,839 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2021-10-13 01:02:57,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2021-10-13 01:02:57,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2021-10-13 01:02:57,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2021-10-13 01:02:57,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2021-10-13 01:02:57,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:02:57,865 INFO L681 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2021-10-13 01:02:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2021-10-13 01:02:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2021-10-13 01:02:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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 01:02:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2021-10-13 01:02:57,913 INFO L704 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2021-10-13 01:02:57,913 INFO L587 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2021-10-13 01:02:57,914 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-13 01:02:57,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2021-10-13 01:02:57,936 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2021-10-13 01:02:57,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:02:57,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:02:57,937 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:02:57,937 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:57,938 INFO L791 eck$LassoCheckResult]: Stem: 6275#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 6255#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_~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_~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;havoc main_~cond~0; 6256#L169-1 [2021-10-13 01:02:57,938 INFO L793 eck$LassoCheckResult]: Loop: 6256#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 6363#L46 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; 6361#L73 assume !(0 != main_~p1~0); 6357#L73-2 assume !(0 != main_~p2~0); 6355#L77-1 assume !(0 != main_~p3~0); 6351#L81-1 assume !(0 != main_~p4~0); 6347#L85-1 assume !(0 != main_~p5~0); 6343#L89-1 assume !(0 != main_~p6~0); 6339#L93-1 assume !(0 != main_~p7~0); 6337#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 6335#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 6333#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 6331#L109-1 assume !(0 != main_~p11~0); 6328#L113-1 assume !(0 != main_~p1~0); 6329#L119-1 assume !(0 != main_~p2~0); 6399#L124-1 assume !(0 != main_~p3~0); 6394#L129-1 assume !(0 != main_~p4~0); 6390#L134-1 assume !(0 != main_~p5~0); 6386#L139-1 assume !(0 != main_~p6~0); 6382#L144-1 assume !(0 != main_~p7~0); 6379#L149-1 assume !(0 != main_~p8~0); 6375#L154-1 assume !(0 != main_~p9~0); 6371#L159-1 assume !(0 != main_~p10~0); 6367#L164-1 assume !(0 != main_~p11~0); 6256#L169-1 [2021-10-13 01:02:57,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,939 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-10-13 01:02:57,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838868965] [2021-10-13 01:02:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,946 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:02:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:57,961 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:02:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:57,968 INFO L82 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2021-10-13 01:02:57,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:57,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979502400] [2021-10-13 01:02:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:57,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:58,018 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 01:02:58,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:58,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979502400] [2021-10-13 01:02:58,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979502400] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:58,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:58,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:58,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884759944] [2021-10-13 01:02:58,020 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:02:58,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:58,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:58,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:58,021 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:58,058 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2021-10-13 01:02:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:58,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2021-10-13 01:02:58,097 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2021-10-13 01:02:58,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2021-10-13 01:02:58,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2021-10-13 01:02:58,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2021-10-13 01:02:58,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2021-10-13 01:02:58,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:02:58,145 INFO L681 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2021-10-13 01:02:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2021-10-13 01:02:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2021-10-13 01:02:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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 01:02:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2021-10-13 01:02:58,287 INFO L704 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2021-10-13 01:02:58,288 INFO L587 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2021-10-13 01:02:58,288 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-13 01:02:58,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2021-10-13 01:02:58,318 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2021-10-13 01:02:58,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:02:58,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:02:58,320 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:02:58,320 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:58,320 INFO L791 eck$LassoCheckResult]: Stem: 12367#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 12345#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_~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_~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;havoc main_~cond~0; 12346#L169-1 [2021-10-13 01:02:58,320 INFO L793 eck$LassoCheckResult]: Loop: 12346#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 12506#L46 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; 12500#L73 assume !(0 != main_~p1~0); 12494#L73-2 assume !(0 != main_~p2~0); 12495#L77-1 assume !(0 != main_~p3~0); 12689#L81-1 assume !(0 != main_~p4~0); 12687#L85-1 assume !(0 != main_~p5~0); 12685#L89-1 assume !(0 != main_~p6~0); 12450#L93-1 assume !(0 != main_~p7~0); 12452#L97-1 assume !(0 != main_~p8~0); 12638#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 12634#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 12630#L109-1 assume !(0 != main_~p11~0); 12626#L113-1 assume !(0 != main_~p1~0); 12627#L119-1 assume !(0 != main_~p2~0); 12684#L124-1 assume !(0 != main_~p3~0); 12681#L129-1 assume !(0 != main_~p4~0); 12679#L134-1 assume !(0 != main_~p5~0); 12677#L139-1 assume !(0 != main_~p6~0); 12675#L144-1 assume !(0 != main_~p7~0); 12672#L149-1 assume !(0 != main_~p8~0); 12670#L154-1 assume !(0 != main_~p9~0); 12532#L159-1 assume !(0 != main_~p10~0); 12518#L164-1 assume !(0 != main_~p11~0); 12346#L169-1 [2021-10-13 01:02:58,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:58,321 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-10-13 01:02:58,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:58,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168793179] [2021-10-13 01:02:58,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:58,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:58,329 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:02:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:58,339 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:02:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:58,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2021-10-13 01:02:58,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:58,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507317272] [2021-10-13 01:02:58,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:58,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:58,368 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 01:02:58,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:58,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507317272] [2021-10-13 01:02:58,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507317272] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:58,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:58,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:58,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383994113] [2021-10-13 01:02:58,371 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:02:58,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:58,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:58,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:58,372 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:58,432 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2021-10-13 01:02:58,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:58,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2021-10-13 01:02:58,501 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2021-10-13 01:02:58,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2021-10-13 01:02:58,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2021-10-13 01:02:58,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2021-10-13 01:02:58,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2021-10-13 01:02:58,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:02:58,647 INFO L681 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2021-10-13 01:02:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2021-10-13 01:02:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2021-10-13 01:02:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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 01:02:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2021-10-13 01:02:58,887 INFO L704 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2021-10-13 01:02:58,887 INFO L587 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2021-10-13 01:02:58,887 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-13 01:02:58,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2021-10-13 01:02:58,923 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2021-10-13 01:02:58,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:02:58,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:02:58,925 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:02:58,925 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:58,926 INFO L791 eck$LassoCheckResult]: Stem: 24342#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 24323#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_~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_~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;havoc main_~cond~0; 24324#L169-1 [2021-10-13 01:02:58,926 INFO L793 eck$LassoCheckResult]: Loop: 24324#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 24735#L46 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; 24728#L73 assume !(0 != main_~p1~0); 24720#L73-2 assume !(0 != main_~p2~0); 24716#L77-1 assume !(0 != main_~p3~0); 24714#L81-1 assume !(0 != main_~p4~0); 24712#L85-1 assume !(0 != main_~p5~0); 24710#L89-1 assume !(0 != main_~p6~0); 24709#L93-1 assume !(0 != main_~p7~0); 24707#L97-1 assume !(0 != main_~p8~0); 24706#L101-1 assume !(0 != main_~p9~0); 24702#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 24699#L109-1 assume !(0 != main_~p11~0); 24695#L113-1 assume !(0 != main_~p1~0); 24681#L119-1 assume !(0 != main_~p2~0); 24678#L124-1 assume !(0 != main_~p3~0); 24669#L129-1 assume !(0 != main_~p4~0); 24659#L134-1 assume !(0 != main_~p5~0); 24649#L139-1 assume !(0 != main_~p6~0); 24639#L144-1 assume !(0 != main_~p7~0); 24630#L149-1 assume !(0 != main_~p8~0); 24631#L154-1 assume !(0 != main_~p9~0); 24832#L159-1 assume !(0 != main_~p10~0); 24746#L164-1 assume !(0 != main_~p11~0); 24324#L169-1 [2021-10-13 01:02:58,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:58,927 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-10-13 01:02:58,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:58,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149297729] [2021-10-13 01:02:58,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:58,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:58,940 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:02:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:58,962 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:02:58,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:58,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2021-10-13 01:02:58,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:58,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495005504] [2021-10-13 01:02:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:58,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:58,985 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 01:02:58,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:58,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495005504] [2021-10-13 01:02:58,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495005504] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:58,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:58,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:58,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341291044] [2021-10-13 01:02:58,987 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 01:02:58,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:58,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:58,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:58,993 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:59,174 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2021-10-13 01:02:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:59,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2021-10-13 01:02:59,378 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2021-10-13 01:02:59,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2021-10-13 01:02:59,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2021-10-13 01:02:59,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2021-10-13 01:02:59,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2021-10-13 01:02:59,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 01:02:59,522 INFO L681 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2021-10-13 01:02:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2021-10-13 01:02:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2021-10-13 01:02:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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 01:02:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2021-10-13 01:02:59,898 INFO L704 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2021-10-13 01:02:59,898 INFO L587 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2021-10-13 01:02:59,898 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-13 01:02:59,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2021-10-13 01:02:59,962 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2021-10-13 01:02:59,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 01:02:59,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 01:02:59,965 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 01:02:59,965 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:59,965 INFO L791 eck$LassoCheckResult]: Stem: 47906#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 47884#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_~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_~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;havoc main_~cond~0; 47885#L169-1 [2021-10-13 01:02:59,966 INFO L793 eck$LassoCheckResult]: Loop: 47885#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 48601#L46 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; 48598#L73 assume !(0 != main_~p1~0); 48594#L73-2 assume !(0 != main_~p2~0); 48591#L77-1 assume !(0 != main_~p3~0); 48588#L81-1 assume !(0 != main_~p4~0); 48584#L85-1 assume !(0 != main_~p5~0); 48580#L89-1 assume !(0 != main_~p6~0); 48576#L93-1 assume !(0 != main_~p7~0); 48572#L97-1 assume !(0 != main_~p8~0); 48568#L101-1 assume !(0 != main_~p9~0); 48569#L105-1 assume !(0 != main_~p10~0); 48527#L109-1 assume !(0 != main_~p11~0); 48528#L113-1 assume !(0 != main_~p1~0); 48643#L119-1 assume !(0 != main_~p2~0); 48637#L124-1 assume !(0 != main_~p3~0); 48631#L129-1 assume !(0 != main_~p4~0); 48626#L134-1 assume !(0 != main_~p5~0); 48622#L139-1 assume !(0 != main_~p6~0); 48617#L144-1 assume !(0 != main_~p7~0); 48612#L149-1 assume !(0 != main_~p8~0); 48609#L154-1 assume !(0 != main_~p9~0); 48607#L159-1 assume !(0 != main_~p10~0); 48606#L164-1 assume !(0 != main_~p11~0); 47885#L169-1 [2021-10-13 01:02:59,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:59,967 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-10-13 01:02:59,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:59,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965420750] [2021-10-13 01:02:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:59,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:59,978 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:02:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:02:59,993 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:02:59,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:59,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2021-10-13 01:02:59,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:59,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655931744] [2021-10-13 01:02:59,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:59,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:03:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:03:00,085 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:03:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:03:00,107 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:03:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:03:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2021-10-13 01:03:00,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:03:00,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187349721] [2021-10-13 01:03:00,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:03:00,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:03:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:03:00,130 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:03:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:03:00,146 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:03:00,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 01:03:00 BoogieIcfgContainer [2021-10-13 01:03:00,874 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-13 01:03:00,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:03:00,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:03:00,875 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:03:00,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:02:56" (3/4) ... [2021-10-13 01:03:00,878 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-13 01:03:00,954 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:03:00,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:03:00,956 INFO L168 Benchmark]: Toolchain (without parser) took 5217.69 ms. Allocated memory was 90.2 MB in the beginning and 278.9 MB in the end (delta: 188.7 MB). Free memory was 55.3 MB in the beginning and 125.6 MB in the end (delta: -70.3 MB). Peak memory consumption was 117.7 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:00,956 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 90.2 MB. Free memory was 60.0 MB in the beginning and 60.0 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:03:00,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.08 ms. Allocated memory is still 90.2 MB. Free memory was 55.0 MB in the beginning and 65.3 MB in the end (delta: -10.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:00,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.29 ms. Allocated memory is still 90.2 MB. Free memory was 65.3 MB in the beginning and 63.7 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:03:00,958 INFO L168 Benchmark]: Boogie Preprocessor took 29.37 ms. Allocated memory is still 90.2 MB. Free memory was 63.7 MB in the beginning and 62.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:00,960 INFO L168 Benchmark]: RCFGBuilder took 351.10 ms. Allocated memory is still 90.2 MB. Free memory was 62.4 MB in the beginning and 50.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:00,960 INFO L168 Benchmark]: BuchiAutomizer took 4437.53 ms. Allocated memory was 90.2 MB in the beginning and 278.9 MB in the end (delta: 188.7 MB). Free memory was 50.2 MB in the beginning and 128.6 MB in the end (delta: -78.4 MB). Peak memory consumption was 112.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:00,960 INFO L168 Benchmark]: Witness Printer took 79.47 ms. Allocated memory is still 278.9 MB. Free memory was 128.6 MB in the beginning and 125.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:00,963 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.32 ms. Allocated memory is still 90.2 MB. Free memory was 60.0 MB in the beginning and 60.0 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 264.08 ms. Allocated memory is still 90.2 MB. Free memory was 55.0 MB in the beginning and 65.3 MB in the end (delta: -10.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.29 ms. Allocated memory is still 90.2 MB. Free memory was 65.3 MB in the beginning and 63.7 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.37 ms. Allocated memory is still 90.2 MB. Free memory was 63.7 MB in the beginning and 62.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 351.10 ms. Allocated memory is still 90.2 MB. Free memory was 62.4 MB in the beginning and 50.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 4437.53 ms. Allocated memory was 90.2 MB in the beginning and 278.9 MB in the end (delta: 188.7 MB). Free memory was 50.2 MB in the beginning and 128.6 MB in the end (delta: -78.4 MB). Peak memory consumption was 112.1 MB. Max. memory is 16.1 GB. * Witness Printer took 79.47 ms. Allocated memory is still 278.9 MB. Free memory was 128.6 MB in the beginning and 125.6 MB in the end (delta: 3.0 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 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 940.9ms AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had 15618 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 796 SDtfs, 411 SDslu, 491 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 87.2ms Time LassoAnalysisResults: nont1 unkn0 SFLI9 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: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=14756} State at position 1 is {NULL=14759, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=14756, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35dc0818=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39ec6fa8=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ad208f2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@542a3979=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@163672c=0, p11=0, lk10=0, lk11=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73ca0a37=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3cee7049=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56fecca7=10, cond=10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b28c987=0, NULL=14758, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7197cf88=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7473d132=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6eb38297=0, NULL=0, NULL=0, NULL=0, NULL=14757, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: 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; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-13 01:03:01,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_980f83f0-06b5-424b-ad4c-8d8efa7e48d6/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...