./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer --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 6423b7e5fbcc52c08e52aff49c79db620dd407c4 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.0-a4ecdab [2020-11-28 03:06:43,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:06:43,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:06:43,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:06:43,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:06:43,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:06:43,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:06:43,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:06:43,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:06:43,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:06:43,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:06:43,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:06:43,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:06:43,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:06:43,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:06:43,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:06:43,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:06:43,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:06:43,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:06:43,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:06:43,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:06:43,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:06:43,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:06:43,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:06:43,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:06:43,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:06:43,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:06:43,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:06:43,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:06:43,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:06:43,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:06:43,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:06:43,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:06:43,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:06:43,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:06:43,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:06:43,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:06:43,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:06:43,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:06:43,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:06:43,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:06:43,918 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:06:43,960 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:06:43,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:06:43,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:06:43,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:06:43,963 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:06:43,964 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:06:43,964 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:06:43,964 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:06:43,964 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:06:43,964 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:06:43,965 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:06:43,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:06:43,966 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:06:43,966 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:06:43,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:06:43,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:06:43,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:06:43,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:06:43,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:06:43,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:06:43,968 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:06:43,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:06:43,968 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:06:43,968 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:06:43,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:06:43,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:06:43,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:06:43,969 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:06:43,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:06:43,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:06:43,971 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:06:43,971 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:06:43,972 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:06:43,973 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-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/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-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer 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 -> 6423b7e5fbcc52c08e52aff49c79db620dd407c4 [2020-11-28 03:06:44,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:06:44,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:06:44,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:06:44,303 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:06:44,305 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:06:44,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_10.c [2020-11-28 03:06:44,390 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/data/9a01d0535/c7211248482f4989975bc4b14d7dc553/FLAGc53ad2eb1 [2020-11-28 03:06:44,948 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:06:44,951 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/sv-benchmarks/c/locks/test_locks_10.c [2020-11-28 03:06:44,966 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/data/9a01d0535/c7211248482f4989975bc4b14d7dc553/FLAGc53ad2eb1 [2020-11-28 03:06:45,294 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/data/9a01d0535/c7211248482f4989975bc4b14d7dc553 [2020-11-28 03:06:45,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:06:45,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:06:45,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:06:45,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:06:45,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:06:45,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:06:45" (1/1) ... [2020-11-28 03:06:45,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56120d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45, skipping insertion in model container [2020-11-28 03:06:45,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:06:45" (1/1) ... [2020-11-28 03:06:45,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:06:45,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:06:45,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:06:45,538 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:06:45,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:06:45,587 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:06:45,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45 WrapperNode [2020-11-28 03:06:45,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:06:45,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:06:45,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:06:45,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:06:45,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45" (1/1) ... [2020-11-28 03:06:45,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45" (1/1) ... [2020-11-28 03:06:45,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:06:45,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:06:45,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:06:45,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:06:45,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45" (1/1) ... [2020-11-28 03:06:45,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45" (1/1) ... [2020-11-28 03:06:45,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45" (1/1) ... [2020-11-28 03:06:45,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45" (1/1) ... [2020-11-28 03:06:45,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45" (1/1) ... [2020-11-28 03:06:45,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45" (1/1) ... [2020-11-28 03:06:45,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45" (1/1) ... [2020-11-28 03:06:45,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:06:45,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:06:45,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:06:45,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:06:45,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:06:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:06:45,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:06:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:06:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:06:46,209 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:06:46,211 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-11-28 03:06:46,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:06:46 BoogieIcfgContainer [2020-11-28 03:06:46,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:06:46,215 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:06:46,215 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:06:46,219 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:06:46,219 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:06:46,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:06:45" (1/3) ... [2020-11-28 03:06:46,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34920251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:06:46, skipping insertion in model container [2020-11-28 03:06:46,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:06:46,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:45" (2/3) ... [2020-11-28 03:06:46,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34920251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:06:46, skipping insertion in model container [2020-11-28 03:06:46,222 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:06:46,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:06:46" (3/3) ... [2020-11-28 03:06:46,224 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2020-11-28 03:06:46,284 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:06:46,284 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:06:46,284 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:06:46,284 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:06:46,284 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:06:46,284 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:06:46,285 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:06:46,285 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:06:46,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2020-11-28 03:06:46,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-11-28 03:06:46,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:06:46,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:06:46,333 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:06:46,333 INFO L853 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] [2020-11-28 03:06:46,333 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:06:46,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2020-11-28 03:06:46,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-11-28 03:06:46,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:06:46,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:06:46,343 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:06:46,343 INFO L853 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] [2020-11-28 03:06:46,350 INFO L794 eck$LassoCheckResult]: Stem: 34#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); 12#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_~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_~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;havoc main_~cond~0; 5#L155-1true [2020-11-28 03:06:46,352 INFO L796 eck$LassoCheckResult]: Loop: 5#L155-1true assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 14#L43true 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; 42#L68true assume 0 != main_~p1~0;main_~lk1~0 := 1; 38#L68-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 30#L72-1true assume !(0 != main_~p3~0); 15#L76-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 3#L80-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 10#L84-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 37#L88-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 26#L92-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 13#L96-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 21#L100-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 7#L104-1true assume !(0 != main_~p1~0); 39#L110-1true assume !(0 != main_~p2~0); 8#L115-1true assume !(0 != main_~p3~0); 18#L120-1true assume !(0 != main_~p4~0); 28#L125-1true assume !(0 != main_~p5~0); 36#L130-1true assume !(0 != main_~p6~0); 6#L135-1true assume !(0 != main_~p7~0); 16#L140-1true assume !(0 != main_~p8~0); 25#L145-1true assume !(0 != main_~p9~0); 33#L150-1true assume !(0 != main_~p10~0); 5#L155-1true [2020-11-28 03:06:46,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-28 03:06:46,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:46,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507282719] [2020-11-28 03:06:46,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:46,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:46,516 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:46,542 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:46,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1693159719, now seen corresponding path program 1 times [2020-11-28 03:06:46,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:46,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415455041] [2020-11-28 03:06:46,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:06:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:06:46,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415455041] [2020-11-28 03:06:46,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:06:46,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:06:46,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953716263] [2020-11-28 03:06:46,707 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:06:46,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:06:46,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:06:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:06:46,725 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-11-28 03:06:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:06:46,785 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2020-11-28 03:06:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:06:46,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 130 transitions. [2020-11-28 03:06:46,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2020-11-28 03:06:46,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 65 states and 103 transitions. [2020-11-28 03:06:46,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2020-11-28 03:06:46,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2020-11-28 03:06:46,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 103 transitions. [2020-11-28 03:06:46,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:06:46,798 INFO L691 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2020-11-28 03:06:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 103 transitions. [2020-11-28 03:06:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-28 03:06:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-28 03:06:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2020-11-28 03:06:46,827 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2020-11-28 03:06:46,827 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2020-11-28 03:06:46,827 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:06:46,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 103 transitions. [2020-11-28 03:06:46,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2020-11-28 03:06:46,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:06:46,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:06:46,830 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:06:46,831 INFO L853 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] [2020-11-28 03:06:46,831 INFO L794 eck$LassoCheckResult]: Stem: 160#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); 142#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_~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_~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;havoc main_~cond~0; 128#L155-1 [2020-11-28 03:06:46,831 INFO L796 eck$LassoCheckResult]: Loop: 128#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 129#L43 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; 145#L68 assume !(0 != main_~p1~0); 174#L68-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 173#L72-1 assume !(0 != main_~p3~0); 172#L76-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 171#L80-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 170#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 169#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 168#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 167#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 166#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 164#L104-1 assume !(0 != main_~p1~0); 165#L110-1 assume !(0 != main_~p2~0); 187#L115-1 assume !(0 != main_~p3~0); 185#L120-1 assume !(0 != main_~p4~0); 152#L125-1 assume !(0 != main_~p5~0); 150#L130-1 assume !(0 != main_~p6~0); 130#L135-1 assume !(0 != main_~p7~0); 132#L140-1 assume !(0 != main_~p8~0); 138#L145-1 assume !(0 != main_~p9~0); 148#L150-1 assume !(0 != main_~p10~0); 128#L155-1 [2020-11-28 03:06:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:46,832 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-28 03:06:46,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:46,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549806896] [2020-11-28 03:06:46,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:46,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:46,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:46,873 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:46,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:46,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1784159127, now seen corresponding path program 1 times [2020-11-28 03:06:46,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:46,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533539678] [2020-11-28 03:06:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:06:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:06:46,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533539678] [2020-11-28 03:06:46,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:06:46,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:06:46,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752621152] [2020-11-28 03:06:46,937 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:06:46,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:06:46,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:06:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:06:46,938 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. cyclomatic complexity: 40 Second operand 3 states. [2020-11-28 03:06:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:06:46,986 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2020-11-28 03:06:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:06:46,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 198 transitions. [2020-11-28 03:06:46,992 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2020-11-28 03:06:46,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 198 transitions. [2020-11-28 03:06:46,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2020-11-28 03:06:46,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2020-11-28 03:06:46,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 198 transitions. [2020-11-28 03:06:46,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:06:46,997 INFO L691 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2020-11-28 03:06:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 198 transitions. [2020-11-28 03:06:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2020-11-28 03:06:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-11-28 03:06:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2020-11-28 03:06:47,011 INFO L714 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2020-11-28 03:06:47,011 INFO L594 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2020-11-28 03:06:47,011 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:06:47,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 198 transitions. [2020-11-28 03:06:47,014 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2020-11-28 03:06:47,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:06:47,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:06:47,015 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:06:47,015 INFO L853 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] [2020-11-28 03:06:47,015 INFO L794 eck$LassoCheckResult]: Stem: 366#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); 340#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_~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_~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;havoc main_~cond~0; 341#L155-1 [2020-11-28 03:06:47,015 INFO L796 eck$LassoCheckResult]: Loop: 341#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 377#L43 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; 378#L68 assume !(0 != main_~p1~0); 413#L68-2 assume !(0 != main_~p2~0); 412#L72-1 assume !(0 != main_~p3~0); 411#L76-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 410#L80-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 409#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 408#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 407#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 406#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 405#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 403#L104-1 assume !(0 != main_~p1~0); 401#L110-1 assume !(0 != main_~p2~0); 400#L115-1 assume !(0 != main_~p3~0); 399#L120-1 assume !(0 != main_~p4~0); 357#L125-1 assume !(0 != main_~p5~0); 353#L130-1 assume !(0 != main_~p6~0); 363#L135-1 assume !(0 != main_~p7~0); 388#L140-1 assume !(0 != main_~p8~0); 387#L145-1 assume !(0 != main_~p9~0); 382#L150-1 assume !(0 != main_~p10~0); 341#L155-1 [2020-11-28 03:06:47,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:47,016 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-28 03:06:47,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:47,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538546095] [2020-11-28 03:06:47,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:47,028 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:47,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:47,046 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:47,047 INFO L82 PathProgramCache]: Analyzing trace with hash 95215385, now seen corresponding path program 1 times [2020-11-28 03:06:47,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:47,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528075129] [2020-11-28 03:06:47,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:06:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:06:47,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528075129] [2020-11-28 03:06:47,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:06:47,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:06:47,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238179696] [2020-11-28 03:06:47,104 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:06:47,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:06:47,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:06:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:06:47,105 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. cyclomatic complexity: 76 Second operand 3 states. [2020-11-28 03:06:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:06:47,146 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2020-11-28 03:06:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:06:47,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 382 transitions. [2020-11-28 03:06:47,152 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2020-11-28 03:06:47,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 246 states and 382 transitions. [2020-11-28 03:06:47,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2020-11-28 03:06:47,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2020-11-28 03:06:47,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 382 transitions. [2020-11-28 03:06:47,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:06:47,171 INFO L691 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2020-11-28 03:06:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 382 transitions. [2020-11-28 03:06:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2020-11-28 03:06:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-11-28 03:06:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 382 transitions. [2020-11-28 03:06:47,200 INFO L714 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2020-11-28 03:06:47,200 INFO L594 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2020-11-28 03:06:47,200 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:06:47,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 382 transitions. [2020-11-28 03:06:47,202 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2020-11-28 03:06:47,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:06:47,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:06:47,203 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:06:47,203 INFO L853 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] [2020-11-28 03:06:47,203 INFO L794 eck$LassoCheckResult]: Stem: 738#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); 717#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_~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_~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;havoc main_~cond~0; 718#L155-1 [2020-11-28 03:06:47,203 INFO L796 eck$LassoCheckResult]: Loop: 718#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 818#L43 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; 816#L68 assume !(0 != main_~p1~0); 810#L68-2 assume !(0 != main_~p2~0); 812#L72-1 assume !(0 != main_~p3~0); 800#L76-1 assume !(0 != main_~p4~0); 802#L80-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 792#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 793#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 784#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 785#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 776#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 777#L104-1 assume !(0 != main_~p1~0); 849#L110-1 assume !(0 != main_~p2~0); 848#L115-1 assume !(0 != main_~p3~0); 845#L120-1 assume !(0 != main_~p4~0); 843#L125-1 assume !(0 != main_~p5~0); 839#L130-1 assume !(0 != main_~p6~0); 835#L135-1 assume !(0 != main_~p7~0); 831#L140-1 assume !(0 != main_~p8~0); 827#L145-1 assume !(0 != main_~p9~0); 823#L150-1 assume !(0 != main_~p10~0); 718#L155-1 [2020-11-28 03:06:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:47,204 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-28 03:06:47,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:47,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481410909] [2020-11-28 03:06:47,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:47,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:47,223 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:47,227 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1493132517, now seen corresponding path program 1 times [2020-11-28 03:06:47,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:47,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264277171] [2020-11-28 03:06:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:06:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:06:47,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264277171] [2020-11-28 03:06:47,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:06:47,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:06:47,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739437987] [2020-11-28 03:06:47,256 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:06:47,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:06:47,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:06:47,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:06:47,257 INFO L87 Difference]: Start difference. First operand 246 states and 382 transitions. cyclomatic complexity: 144 Second operand 3 states. [2020-11-28 03:06:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:06:47,292 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2020-11-28 03:06:47,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:06:47,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 738 transitions. [2020-11-28 03:06:47,303 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2020-11-28 03:06:47,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 738 transitions. [2020-11-28 03:06:47,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2020-11-28 03:06:47,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2020-11-28 03:06:47,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 738 transitions. [2020-11-28 03:06:47,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:06:47,320 INFO L691 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2020-11-28 03:06:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 738 transitions. [2020-11-28 03:06:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-11-28 03:06:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-11-28 03:06:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 738 transitions. [2020-11-28 03:06:47,349 INFO L714 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2020-11-28 03:06:47,349 INFO L594 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2020-11-28 03:06:47,349 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:06:47,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 738 transitions. [2020-11-28 03:06:47,376 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2020-11-28 03:06:47,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:06:47,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:06:47,379 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:06:47,380 INFO L853 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] [2020-11-28 03:06:47,383 INFO L794 eck$LassoCheckResult]: Stem: 1476#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); 1455#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_~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_~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;havoc main_~cond~0; 1456#L155-1 [2020-11-28 03:06:47,383 INFO L796 eck$LassoCheckResult]: Loop: 1456#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 1530#L43 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; 1528#L68 assume !(0 != main_~p1~0); 1524#L68-2 assume !(0 != main_~p2~0); 1522#L72-1 assume !(0 != main_~p3~0); 1518#L76-1 assume !(0 != main_~p4~0); 1514#L80-1 assume !(0 != main_~p5~0); 1512#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1510#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1508#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1506#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1504#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1501#L104-1 assume !(0 != main_~p1~0); 1502#L110-1 assume !(0 != main_~p2~0); 1562#L115-1 assume !(0 != main_~p3~0); 1557#L120-1 assume !(0 != main_~p4~0); 1553#L125-1 assume !(0 != main_~p5~0); 1550#L130-1 assume !(0 != main_~p6~0); 1546#L135-1 assume !(0 != main_~p7~0); 1542#L140-1 assume !(0 != main_~p8~0); 1538#L145-1 assume !(0 != main_~p9~0); 1534#L150-1 assume !(0 != main_~p10~0); 1456#L155-1 [2020-11-28 03:06:47,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-11-28 03:06:47,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:47,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800144764] [2020-11-28 03:06:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:47,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:47,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:47,429 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:47,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:47,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1780766425, now seen corresponding path program 1 times [2020-11-28 03:06:47,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:47,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213722360] [2020-11-28 03:06:47,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:06:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:06:47,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213722360] [2020-11-28 03:06:47,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:06:47,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:06:47,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503391153] [2020-11-28 03:06:47,471 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:06:47,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:06:47,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:06:47,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:06:47,472 INFO L87 Difference]: Start difference. First operand 482 states and 738 transitions. cyclomatic complexity: 272 Second operand 3 states. [2020-11-28 03:06:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:06:47,496 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2020-11-28 03:06:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:06:47,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1426 transitions. [2020-11-28 03:06:47,506 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2020-11-28 03:06:47,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1426 transitions. [2020-11-28 03:06:47,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2020-11-28 03:06:47,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2020-11-28 03:06:47,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1426 transitions. [2020-11-28 03:06:47,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:06:47,518 INFO L691 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2020-11-28 03:06:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1426 transitions. [2020-11-28 03:06:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2020-11-28 03:06:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2020-11-28 03:06:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1426 transitions. [2020-11-28 03:06:47,547 INFO L714 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2020-11-28 03:06:47,547 INFO L594 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2020-11-28 03:06:47,547 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 03:06:47,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1426 transitions. [2020-11-28 03:06:47,554 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2020-11-28 03:06:47,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:06:47,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:06:47,555 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:06:47,555 INFO L853 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] [2020-11-28 03:06:47,555 INFO L794 eck$LassoCheckResult]: Stem: 2909#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); 2887#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_~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_~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;havoc main_~cond~0; 2888#L155-1 [2020-11-28 03:06:47,555 INFO L796 eck$LassoCheckResult]: Loop: 2888#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 2992#L43 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; 2988#L68 assume !(0 != main_~p1~0); 2981#L68-2 assume !(0 != main_~p2~0); 2976#L72-1 assume !(0 != main_~p3~0); 2969#L76-1 assume !(0 != main_~p4~0); 2961#L80-1 assume !(0 != main_~p5~0); 2955#L84-1 assume !(0 != main_~p6~0); 2949#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2950#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2941#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2942#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2935#L104-1 assume !(0 != main_~p1~0); 2936#L110-1 assume !(0 != main_~p2~0); 3053#L115-1 assume !(0 != main_~p3~0); 3044#L120-1 assume !(0 != main_~p4~0); 3040#L125-1 assume !(0 != main_~p5~0); 3032#L130-1 assume !(0 != main_~p6~0); 3029#L135-1 assume !(0 != main_~p7~0); 3009#L140-1 assume !(0 != main_~p8~0); 3005#L145-1 assume !(0 != main_~p9~0); 3001#L150-1 assume !(0 != main_~p10~0); 2888#L155-1 [2020-11-28 03:06:47,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:47,556 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-11-28 03:06:47,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:47,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966594227] [2020-11-28 03:06:47,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:47,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:47,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:47,587 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:47,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:47,603 INFO L82 PathProgramCache]: Analyzing trace with hash 500902747, now seen corresponding path program 1 times [2020-11-28 03:06:47,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:47,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251335929] [2020-11-28 03:06:47,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:06:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:06:47,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251335929] [2020-11-28 03:06:47,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:06:47,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:06:47,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237183774] [2020-11-28 03:06:47,670 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:06:47,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:06:47,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:06:47,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:06:47,671 INFO L87 Difference]: Start difference. First operand 946 states and 1426 transitions. cyclomatic complexity: 512 Second operand 3 states. [2020-11-28 03:06:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:06:47,745 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2020-11-28 03:06:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:06:47,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2754 transitions. [2020-11-28 03:06:47,782 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2020-11-28 03:06:47,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2754 transitions. [2020-11-28 03:06:47,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1858 [2020-11-28 03:06:47,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1858 [2020-11-28 03:06:47,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2754 transitions. [2020-11-28 03:06:47,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:06:47,806 INFO L691 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2020-11-28 03:06:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2754 transitions. [2020-11-28 03:06:47,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2020-11-28 03:06:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2020-11-28 03:06:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2754 transitions. [2020-11-28 03:06:47,883 INFO L714 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2020-11-28 03:06:47,883 INFO L594 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2020-11-28 03:06:47,884 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 03:06:47,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1858 states and 2754 transitions. [2020-11-28 03:06:47,900 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2020-11-28 03:06:47,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:06:47,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:06:47,901 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:06:47,901 INFO L853 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] [2020-11-28 03:06:47,902 INFO L794 eck$LassoCheckResult]: Stem: 5718#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); 5696#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_~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_~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;havoc main_~cond~0; 5697#L155-1 [2020-11-28 03:06:47,903 INFO L796 eck$LassoCheckResult]: Loop: 5697#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 5855#L43 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; 5853#L68 assume !(0 != main_~p1~0); 5851#L68-2 assume !(0 != main_~p2~0); 5850#L72-1 assume !(0 != main_~p3~0); 5848#L76-1 assume !(0 != main_~p4~0); 5845#L80-1 assume !(0 != main_~p5~0); 5841#L84-1 assume !(0 != main_~p6~0); 5838#L88-1 assume !(0 != main_~p7~0); 5835#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5836#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5827#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 5828#L104-1 assume !(0 != main_~p1~0); 5815#L110-1 assume !(0 != main_~p2~0); 5816#L115-1 assume !(0 != main_~p3~0); 5803#L120-1 assume !(0 != main_~p4~0); 5805#L125-1 assume !(0 != main_~p5~0); 5793#L130-1 assume !(0 != main_~p6~0); 5794#L135-1 assume !(0 != main_~p7~0); 5861#L140-1 assume !(0 != main_~p8~0); 5859#L145-1 assume !(0 != main_~p9~0); 5857#L150-1 assume !(0 != main_~p10~0); 5697#L155-1 [2020-11-28 03:06:47,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-11-28 03:06:47,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:47,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894734473] [2020-11-28 03:06:47,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:47,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:47,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:47,952 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:47,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash -510214503, now seen corresponding path program 1 times [2020-11-28 03:06:47,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:47,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345382095] [2020-11-28 03:06:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:06:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:06:47,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345382095] [2020-11-28 03:06:47,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:06:47,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:06:47,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45412365] [2020-11-28 03:06:47,999 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:06:47,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:06:48,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:06:48,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:06:48,000 INFO L87 Difference]: Start difference. First operand 1858 states and 2754 transitions. cyclomatic complexity: 960 Second operand 3 states. [2020-11-28 03:06:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:06:48,048 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2020-11-28 03:06:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:06:48,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 5314 transitions. [2020-11-28 03:06:48,088 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2020-11-28 03:06:48,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 5314 transitions. [2020-11-28 03:06:48,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2020-11-28 03:06:48,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2020-11-28 03:06:48,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 5314 transitions. [2020-11-28 03:06:48,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:06:48,135 INFO L691 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2020-11-28 03:06:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 5314 transitions. [2020-11-28 03:06:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650. [2020-11-28 03:06:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3650 states. [2020-11-28 03:06:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5314 transitions. [2020-11-28 03:06:48,249 INFO L714 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2020-11-28 03:06:48,249 INFO L594 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2020-11-28 03:06:48,249 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 03:06:48,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 5314 transitions. [2020-11-28 03:06:48,272 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2020-11-28 03:06:48,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:06:48,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:06:48,275 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:06:48,275 INFO L853 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] [2020-11-28 03:06:48,275 INFO L794 eck$LassoCheckResult]: Stem: 11239#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); 11209#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_~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_~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;havoc main_~cond~0; 11210#L155-1 [2020-11-28 03:06:48,276 INFO L796 eck$LassoCheckResult]: Loop: 11210#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 11460#L43 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; 11458#L68 assume !(0 != main_~p1~0); 11456#L68-2 assume !(0 != main_~p2~0); 11455#L72-1 assume !(0 != main_~p3~0); 11453#L76-1 assume !(0 != main_~p4~0); 11451#L80-1 assume !(0 != main_~p5~0); 11449#L84-1 assume !(0 != main_~p6~0); 11445#L88-1 assume !(0 != main_~p7~0); 11442#L92-1 assume !(0 != main_~p8~0); 11433#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 11434#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 11411#L104-1 assume !(0 != main_~p1~0); 11412#L110-1 assume !(0 != main_~p2~0); 11393#L115-1 assume !(0 != main_~p3~0); 11392#L120-1 assume !(0 != main_~p4~0); 11372#L125-1 assume !(0 != main_~p5~0); 11373#L130-1 assume !(0 != main_~p6~0); 11351#L135-1 assume !(0 != main_~p7~0); 11352#L140-1 assume !(0 != main_~p8~0); 11464#L145-1 assume !(0 != main_~p9~0); 11462#L150-1 assume !(0 != main_~p10~0); 11210#L155-1 [2020-11-28 03:06:48,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-11-28 03:06:48,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:48,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226916397] [2020-11-28 03:06:48,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:48,290 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:48,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:48,305 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1097020517, now seen corresponding path program 1 times [2020-11-28 03:06:48,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:48,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22026477] [2020-11-28 03:06:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:06:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:06:48,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22026477] [2020-11-28 03:06:48,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:06:48,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:06:48,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187564141] [2020-11-28 03:06:48,352 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:06:48,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:06:48,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:06:48,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:06:48,352 INFO L87 Difference]: Start difference. First operand 3650 states and 5314 transitions. cyclomatic complexity: 1792 Second operand 3 states. [2020-11-28 03:06:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:06:48,408 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2020-11-28 03:06:48,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:06:48,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7170 states and 10242 transitions. [2020-11-28 03:06:48,519 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2020-11-28 03:06:48,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7170 states to 7170 states and 10242 transitions. [2020-11-28 03:06:48,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7170 [2020-11-28 03:06:48,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7170 [2020-11-28 03:06:48,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7170 states and 10242 transitions. [2020-11-28 03:06:48,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:06:48,602 INFO L691 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2020-11-28 03:06:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states and 10242 transitions. [2020-11-28 03:06:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7170. [2020-11-28 03:06:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7170 states. [2020-11-28 03:06:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 10242 transitions. [2020-11-28 03:06:48,816 INFO L714 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2020-11-28 03:06:48,816 INFO L594 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2020-11-28 03:06:48,816 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-28 03:06:48,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7170 states and 10242 transitions. [2020-11-28 03:06:48,844 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2020-11-28 03:06:48,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:06:48,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:06:48,846 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:06:48,846 INFO L853 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] [2020-11-28 03:06:48,847 INFO L794 eck$LassoCheckResult]: Stem: 22061#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); 22037#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_~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_~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;havoc main_~cond~0; 22038#L155-1 [2020-11-28 03:06:48,847 INFO L796 eck$LassoCheckResult]: Loop: 22038#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 22428#L43 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; 22426#L68 assume !(0 != main_~p1~0); 22424#L68-2 assume !(0 != main_~p2~0); 22423#L72-1 assume !(0 != main_~p3~0); 22422#L76-1 assume !(0 != main_~p4~0); 22420#L80-1 assume !(0 != main_~p5~0); 22418#L84-1 assume !(0 != main_~p6~0); 22415#L88-1 assume !(0 != main_~p7~0); 22411#L92-1 assume !(0 != main_~p8~0); 22407#L96-1 assume !(0 != main_~p9~0); 22308#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 22309#L104-1 assume !(0 != main_~p1~0); 22399#L110-1 assume !(0 != main_~p2~0); 22398#L115-1 assume !(0 != main_~p3~0); 22247#L120-1 assume !(0 != main_~p4~0); 22249#L125-1 assume !(0 != main_~p5~0); 22238#L130-1 assume !(0 != main_~p6~0); 22240#L135-1 assume !(0 != main_~p7~0); 22230#L140-1 assume !(0 != main_~p8~0); 22231#L145-1 assume !(0 != main_~p9~0); 22390#L150-1 assume !(0 != main_~p10~0); 22038#L155-1 [2020-11-28 03:06:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-11-28 03:06:48,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:48,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688167723] [2020-11-28 03:06:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:48,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:48,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:48,887 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:48,891 INFO L82 PathProgramCache]: Analyzing trace with hash -838855079, now seen corresponding path program 1 times [2020-11-28 03:06:48,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:48,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416405925] [2020-11-28 03:06:48,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:06:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:06:48,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416405925] [2020-11-28 03:06:48,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:06:48,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:06:48,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527238076] [2020-11-28 03:06:48,907 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:06:48,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:06:48,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:06:48,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:06:48,908 INFO L87 Difference]: Start difference. First operand 7170 states and 10242 transitions. cyclomatic complexity: 3328 Second operand 3 states. [2020-11-28 03:06:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:06:49,029 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2020-11-28 03:06:49,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:06:49,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14082 states and 19714 transitions. [2020-11-28 03:06:49,104 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2020-11-28 03:06:49,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14082 states to 14082 states and 19714 transitions. [2020-11-28 03:06:49,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14082 [2020-11-28 03:06:49,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14082 [2020-11-28 03:06:49,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14082 states and 19714 transitions. [2020-11-28 03:06:49,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:06:49,322 INFO L691 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2020-11-28 03:06:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states and 19714 transitions. [2020-11-28 03:06:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 14082. [2020-11-28 03:06:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14082 states. [2020-11-28 03:06:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 19714 transitions. [2020-11-28 03:06:49,774 INFO L714 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2020-11-28 03:06:49,774 INFO L594 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2020-11-28 03:06:49,774 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-28 03:06:49,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14082 states and 19714 transitions. [2020-11-28 03:06:49,836 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2020-11-28 03:06:49,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:06:49,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:06:49,838 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:06:49,838 INFO L853 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] [2020-11-28 03:06:49,842 INFO L794 eck$LassoCheckResult]: Stem: 43316#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); 43295#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_~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_~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;havoc main_~cond~0; 43296#L155-1 [2020-11-28 03:06:49,842 INFO L796 eck$LassoCheckResult]: Loop: 43296#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 43573#L43 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; 43565#L68 assume !(0 != main_~p1~0); 43557#L68-2 assume !(0 != main_~p2~0); 43548#L72-1 assume !(0 != main_~p3~0); 43539#L76-1 assume !(0 != main_~p4~0); 43531#L80-1 assume !(0 != main_~p5~0); 43491#L84-1 assume !(0 != main_~p6~0); 43489#L88-1 assume !(0 != main_~p7~0); 43488#L92-1 assume !(0 != main_~p8~0); 43486#L96-1 assume !(0 != main_~p9~0); 43484#L100-1 assume !(0 != main_~p10~0); 43485#L104-1 assume !(0 != main_~p1~0); 43663#L110-1 assume !(0 != main_~p2~0); 43783#L115-1 assume !(0 != main_~p3~0); 43778#L120-1 assume !(0 != main_~p4~0); 43775#L125-1 assume !(0 != main_~p5~0); 43772#L130-1 assume !(0 != main_~p6~0); 43670#L135-1 assume !(0 != main_~p7~0); 43424#L140-1 assume !(0 != main_~p8~0); 43425#L145-1 assume !(0 != main_~p9~0); 43448#L150-1 assume !(0 != main_~p10~0); 43296#L155-1 [2020-11-28 03:06:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:49,843 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-11-28 03:06:49,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:49,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417826811] [2020-11-28 03:06:49,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:49,856 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:49,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:49,876 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:49,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash -137790501, now seen corresponding path program 1 times [2020-11-28 03:06:49,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:49,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656443011] [2020-11-28 03:06:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:49,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:49,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:49,898 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:49,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:06:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash -970235363, now seen corresponding path program 1 times [2020-11-28 03:06:49,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:06:49,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113920852] [2020-11-28 03:06:49,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:06:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:49,915 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:06:49,924 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:06:49,935 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:06:50,374 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2020-11-28 03:06:50,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:06:50 BoogieIcfgContainer [2020-11-28 03:06:50,548 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:06:50,551 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:06:50,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:06:50,551 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:06:50,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:06:46" (3/4) ... [2020-11-28 03:06:50,554 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-28 03:06:50,605 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_78b3b834-0d1b-4211-8c45-d3f9a8b1c4e4/bin/uautomizer/witness.graphml [2020-11-28 03:06:50,605 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:06:50,607 INFO L168 Benchmark]: Toolchain (without parser) took 5309.70 ms. Allocated memory was 90.2 MB in the beginning and 314.6 MB in the end (delta: 224.4 MB). Free memory was 60.0 MB in the beginning and 203.4 MB in the end (delta: -143.4 MB). Peak memory consumption was 81.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:06:50,607 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 90.2 MB. Free memory was 46.5 MB in the beginning and 46.5 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:06:50,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.59 ms. Allocated memory is still 90.2 MB. Free memory was 59.6 MB in the beginning and 67.3 MB in the end (delta: -7.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:06:50,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.06 ms. Allocated memory is still 90.2 MB. Free memory was 67.3 MB in the beginning and 65.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:06:50,609 INFO L168 Benchmark]: Boogie Preprocessor took 42.22 ms. Allocated memory is still 90.2 MB. Free memory was 65.6 MB in the beginning and 64.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:06:50,609 INFO L168 Benchmark]: RCFGBuilder took 545.77 ms. Allocated memory is still 90.2 MB. Free memory was 64.5 MB in the beginning and 45.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:06:50,610 INFO L168 Benchmark]: BuchiAutomizer took 4332.88 ms. Allocated memory was 90.2 MB in the beginning and 314.6 MB in the end (delta: 224.4 MB). Free memory was 45.2 MB in the beginning and 205.4 MB in the end (delta: -160.3 MB). Peak memory consumption was 145.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:06:50,610 INFO L168 Benchmark]: Witness Printer took 54.77 ms. Allocated memory is still 314.6 MB. Free memory was 205.4 MB in the beginning and 203.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:06:50,613 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.75 ms. Allocated memory is still 90.2 MB. Free memory was 46.5 MB in the beginning and 46.5 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 289.59 ms. Allocated memory is still 90.2 MB. Free memory was 59.6 MB in the beginning and 67.3 MB in the end (delta: -7.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.06 ms. Allocated memory is still 90.2 MB. Free memory was 67.3 MB in the beginning and 65.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.22 ms. Allocated memory is still 90.2 MB. Free memory was 65.6 MB in the beginning and 64.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 545.77 ms. Allocated memory is still 90.2 MB. Free memory was 64.5 MB in the beginning and 45.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 4332.88 ms. Allocated memory was 90.2 MB in the beginning and 314.6 MB in the end (delta: 224.4 MB). Free memory was 45.2 MB in the beginning and 205.4 MB in the end (delta: -160.3 MB). Peak memory consumption was 145.3 MB. Max. memory is 16.1 GB. * Witness Printer took 54.77 ms. Allocated memory is still 314.6 MB. Free memory was 205.4 MB in the beginning and 203.4 MB in the end (delta: 2.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 14082 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had 14082 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 722 SDtfs, 374 SDslu, 445 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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: 41]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=2, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=1, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@113bb626=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3342b68a=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32273fa6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@339ac0db=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f5cda08=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@112e0d0d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b91b99c=14, cond=14, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@598cd58f=0, NULL=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52dd1b17=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3724958f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2eb185f9=0, NULL=0, NULL=0, NULL=0, NULL=4, 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: 41]: 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; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...