./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_9.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_f9952eeb-1e03-4571-964b-bc9926f5485e/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/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 20a70402cc893fb2c7adec21ca8a267adc3c5cbb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:10:09,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:10:09,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:10:09,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:10:09,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:10:09,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:10:09,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:10:09,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:10:09,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:10:09,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:10:09,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:10:09,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:10:09,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:10:09,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:10:09,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:10:09,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:10:09,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:10:09,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:10:09,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:10:09,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:10:09,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:10:09,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:10:09,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:10:09,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:10:09,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:10:09,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:10:09,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:10:09,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:10:09,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:10:09,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:10:09,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:10:09,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:10:09,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:10:09,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:10:09,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:10:09,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:10:09,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:10:09,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:10:09,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:10:09,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:10:09,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:10:09,842 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:10:09,866 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:10:09,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:10:09,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:10:09,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:10:09,868 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:10:09,868 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:10:09,869 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:10:09,869 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:10:09,869 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:10:09,869 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:10:09,870 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:10:09,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:10:09,871 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:10:09,871 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:10:09,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:10:09,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:10:09,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:10:09,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:10:09,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:10:09,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:10:09,872 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:10:09,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:10:09,873 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:10:09,873 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:10:09,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:10:09,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:10:09,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:10:09,874 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:10:09,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:10:09,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:10:09,874 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:10:09,875 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:10:09,876 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:10:09,876 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_f9952eeb-1e03-4571-964b-bc9926f5485e/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_f9952eeb-1e03-4571-964b-bc9926f5485e/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 -> 20a70402cc893fb2c7adec21ca8a267adc3c5cbb [2020-11-28 03:10:10,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:10:10,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:10:10,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:10:10,167 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:10:10,168 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:10:10,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_9.c [2020-11-28 03:10:10,251 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/bin/uautomizer/data/c02e798e0/1468e87b942f419885c7477eb34e3956/FLAG4948399c4 [2020-11-28 03:10:10,722 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:10:10,723 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/sv-benchmarks/c/locks/test_locks_9.c [2020-11-28 03:10:10,730 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/bin/uautomizer/data/c02e798e0/1468e87b942f419885c7477eb34e3956/FLAG4948399c4 [2020-11-28 03:10:11,121 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/bin/uautomizer/data/c02e798e0/1468e87b942f419885c7477eb34e3956 [2020-11-28 03:10:11,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:10:11,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:10:11,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:10:11,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:10:11,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:10:11,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:10:11" (1/1) ... [2020-11-28 03:10:11,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b712a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:11, skipping insertion in model container [2020-11-28 03:10:11,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:10:11" (1/1) ... [2020-11-28 03:10:11,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:10:11,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:10:11,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:10:11,339 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:10:11,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:10:11,382 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:10:11,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:11 WrapperNode [2020-11-28 03:10:11,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:10:11,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:10:11,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:10:11,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:10:11,395 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:10:11" (1/1) ... [2020-11-28 03:10:11,408 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:10:11" (1/1) ... [2020-11-28 03:10:11,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:10:11,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:10:11,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:10:11,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:10:11,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:11" (1/1) ... [2020-11-28 03:10:11,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:11" (1/1) ... [2020-11-28 03:10:11,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:11" (1/1) ... [2020-11-28 03:10:11,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:11" (1/1) ... [2020-11-28 03:10:11,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:11" (1/1) ... [2020-11-28 03:10:11,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:11" (1/1) ... [2020-11-28 03:10:11,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:11" (1/1) ... [2020-11-28 03:10:11,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:10:11,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:10:11,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:10:11,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:10:11,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/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:10:11,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:10:11,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:10:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:10:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:10:12,011 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:10:12,012 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-11-28 03:10:12,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:10:12 BoogieIcfgContainer [2020-11-28 03:10:12,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:10:12,015 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:10:12,016 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:10:12,019 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:10:12,020 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:10:12,021 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:10:11" (1/3) ... [2020-11-28 03:10:12,023 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@549453c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:10:12, skipping insertion in model container [2020-11-28 03:10:12,023 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:10:12,024 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:11" (2/3) ... [2020-11-28 03:10:12,024 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@549453c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:10:12, skipping insertion in model container [2020-11-28 03:10:12,024 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:10:12,024 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:10:12" (3/3) ... [2020-11-28 03:10:12,026 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2020-11-28 03:10:12,062 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:10:12,062 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:10:12,063 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:10:12,063 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:10:12,063 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:10:12,063 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:10:12,063 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:10:12,063 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:10:12,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-11-28 03:10:12,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-11-28 03:10:12,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:10:12,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:10:12,103 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:10:12,104 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] [2020-11-28 03:10:12,104 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:10:12,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-11-28 03:10:12,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-11-28 03:10:12,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:10:12,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:10:12,109 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:10:12,109 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] [2020-11-28 03:10:12,116 INFO L794 eck$LassoCheckResult]: Stem: 33#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(15);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_~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_~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;havoc main_~cond~0; 35#L141-1true [2020-11-28 03:10:12,117 INFO L796 eck$LassoCheckResult]: Loop: 35#L141-1true assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 8#L40true 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; 13#L63true assume 0 != main_~p1~0;main_~lk1~0 := 1; 28#L63-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 18#L67-1true assume !(0 != main_~p3~0); 5#L71-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 31#L75-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 37#L79-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 27#L83-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 16#L87-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 3#L91-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 9#L95-1true assume !(0 != main_~p1~0); 38#L101-1true assume !(0 != main_~p2~0); 10#L106-1true assume !(0 != main_~p3~0); 23#L111-1true assume !(0 != main_~p4~0); 30#L116-1true assume !(0 != main_~p5~0); 36#L121-1true assume !(0 != main_~p6~0); 7#L126-1true assume !(0 != main_~p7~0); 19#L131-1true assume !(0 != main_~p8~0); 26#L136-1true assume !(0 != main_~p9~0); 35#L141-1true [2020-11-28 03:10:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:12,123 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-28 03:10:12,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:12,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906485482] [2020-11-28 03:10:12,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:12,225 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:12,243 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:12,264 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:12,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:12,266 INFO L82 PathProgramCache]: Analyzing trace with hash 694706197, now seen corresponding path program 1 times [2020-11-28 03:10:12,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:12,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036120913] [2020-11-28 03:10:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:12,337 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:10:12,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036120913] [2020-11-28 03:10:12,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:12,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:12,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413797303] [2020-11-28 03:10:12,344 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:10:12,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:12,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:12,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:12,362 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-11-28 03:10:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:12,405 INFO L93 Difference]: Finished difference Result 69 states and 118 transitions. [2020-11-28 03:10:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:12,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 118 transitions. [2020-11-28 03:10:12,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2020-11-28 03:10:12,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 59 states and 93 transitions. [2020-11-28 03:10:12,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2020-11-28 03:10:12,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2020-11-28 03:10:12,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 93 transitions. [2020-11-28 03:10:12,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:10:12,420 INFO L691 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2020-11-28 03:10:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 93 transitions. [2020-11-28 03:10:12,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-28 03:10:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-28 03:10:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 93 transitions. [2020-11-28 03:10:12,449 INFO L714 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2020-11-28 03:10:12,449 INFO L594 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2020-11-28 03:10:12,449 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:10:12,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 93 transitions. [2020-11-28 03:10:12,451 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2020-11-28 03:10:12,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:10:12,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:10:12,452 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:10:12,452 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] [2020-11-28 03:10:12,452 INFO L794 eck$LassoCheckResult]: Stem: 147#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 133#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_~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_~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;havoc main_~cond~0; 134#L141-1 [2020-11-28 03:10:12,452 INFO L796 eck$LassoCheckResult]: Loop: 134#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 151#L40 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; 150#L63 assume !(0 != main_~p1~0); 145#L63-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 140#L67-1 assume !(0 != main_~p3~0); 119#L71-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 120#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 146#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 144#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 138#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 139#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 167#L95-1 assume !(0 != main_~p1~0); 149#L101-1 assume !(0 != main_~p2~0); 128#L106-1 assume !(0 != main_~p3~0); 129#L111-1 assume !(0 != main_~p4~0); 141#L116-1 assume !(0 != main_~p5~0); 118#L121-1 assume !(0 != main_~p6~0); 123#L126-1 assume !(0 != main_~p7~0); 124#L131-1 assume !(0 != main_~p8~0); 132#L136-1 assume !(0 != main_~p9~0); 134#L141-1 [2020-11-28 03:10:12,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:12,453 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-28 03:10:12,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:12,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445593235] [2020-11-28 03:10:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:12,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:12,482 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:12,488 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:12,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:12,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1299438509, now seen corresponding path program 1 times [2020-11-28 03:10:12,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:12,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145610261] [2020-11-28 03:10:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:12,539 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:10:12,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145610261] [2020-11-28 03:10:12,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:12,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:12,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364687322] [2020-11-28 03:10:12,541 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:10:12,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:12,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:12,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:12,542 INFO L87 Difference]: Start difference. First operand 59 states and 93 transitions. cyclomatic complexity: 36 Second operand 3 states. [2020-11-28 03:10:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:12,574 INFO L93 Difference]: Finished difference Result 114 states and 178 transitions. [2020-11-28 03:10:12,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:12,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 178 transitions. [2020-11-28 03:10:12,590 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2020-11-28 03:10:12,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 178 transitions. [2020-11-28 03:10:12,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2020-11-28 03:10:12,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2020-11-28 03:10:12,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 178 transitions. [2020-11-28 03:10:12,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:10:12,596 INFO L691 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2020-11-28 03:10:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 178 transitions. [2020-11-28 03:10:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-11-28 03:10:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-28 03:10:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2020-11-28 03:10:12,622 INFO L714 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2020-11-28 03:10:12,622 INFO L594 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2020-11-28 03:10:12,622 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:10:12,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 178 transitions. [2020-11-28 03:10:12,627 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2020-11-28 03:10:12,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:10:12,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:10:12,640 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:10:12,640 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] [2020-11-28 03:10:12,640 INFO L794 eck$LassoCheckResult]: Stem: 330#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 317#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_~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_~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;havoc main_~cond~0; 318#L141-1 [2020-11-28 03:10:12,640 INFO L796 eck$LassoCheckResult]: Loop: 318#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 337#L40 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; 365#L63 assume !(0 != main_~p1~0); 366#L63-2 assume !(0 != main_~p2~0); 403#L67-1 assume !(0 != main_~p3~0); 407#L71-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 406#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 405#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 390#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 389#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 387#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 384#L95-1 assume !(0 != main_~p1~0); 383#L101-1 assume !(0 != main_~p2~0); 310#L106-1 assume !(0 != main_~p3~0); 311#L111-1 assume !(0 != main_~p4~0); 325#L116-1 assume !(0 != main_~p5~0); 297#L121-1 assume !(0 != main_~p6~0); 314#L126-1 assume !(0 != main_~p7~0); 374#L131-1 assume !(0 != main_~p8~0); 372#L136-1 assume !(0 != main_~p9~0); 318#L141-1 [2020-11-28 03:10:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:12,641 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-28 03:10:12,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:12,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595278288] [2020-11-28 03:10:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:12,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:12,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:12,670 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:12,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:12,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1407180885, now seen corresponding path program 1 times [2020-11-28 03:10:12,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:12,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207199816] [2020-11-28 03:10:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:12,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:10:12,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207199816] [2020-11-28 03:10:12,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:12,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:12,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580221542] [2020-11-28 03:10:12,702 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:10:12,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:12,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:12,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:12,703 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. cyclomatic complexity: 68 Second operand 3 states. [2020-11-28 03:10:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:12,748 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2020-11-28 03:10:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:12,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 342 transitions. [2020-11-28 03:10:12,753 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2020-11-28 03:10:12,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 342 transitions. [2020-11-28 03:10:12,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2020-11-28 03:10:12,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2020-11-28 03:10:12,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 342 transitions. [2020-11-28 03:10:12,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:10:12,759 INFO L691 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2020-11-28 03:10:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 342 transitions. [2020-11-28 03:10:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2020-11-28 03:10:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-11-28 03:10:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2020-11-28 03:10:12,776 INFO L714 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2020-11-28 03:10:12,777 INFO L594 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2020-11-28 03:10:12,777 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:10:12,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 342 transitions. [2020-11-28 03:10:12,779 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2020-11-28 03:10:12,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:10:12,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:10:12,780 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:10:12,780 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] [2020-11-28 03:10:12,780 INFO L794 eck$LassoCheckResult]: Stem: 674#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 657#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_~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_~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;havoc main_~cond~0; 658#L141-1 [2020-11-28 03:10:12,780 INFO L796 eck$LassoCheckResult]: Loop: 658#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 817#L40 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; 816#L63 assume !(0 != main_~p1~0); 815#L63-2 assume !(0 != main_~p2~0); 662#L67-1 assume !(0 != main_~p3~0); 663#L71-1 assume !(0 != main_~p4~0); 776#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 777#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 767#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 768#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 758#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 759#L95-1 assume !(0 != main_~p1~0); 786#L101-1 assume !(0 != main_~p2~0); 651#L106-1 assume !(0 != main_~p3~0); 652#L111-1 assume !(0 != main_~p4~0); 803#L116-1 assume !(0 != main_~p5~0); 825#L121-1 assume !(0 != main_~p6~0); 797#L126-1 assume !(0 != main_~p7~0); 795#L131-1 assume !(0 != main_~p8~0); 793#L136-1 assume !(0 != main_~p9~0); 658#L141-1 [2020-11-28 03:10:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:12,781 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-28 03:10:12,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:12,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075189325] [2020-11-28 03:10:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:12,792 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:12,801 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:12,806 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:12,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:12,806 INFO L82 PathProgramCache]: Analyzing trace with hash 127317207, now seen corresponding path program 1 times [2020-11-28 03:10:12,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:12,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599297722] [2020-11-28 03:10:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:12,853 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:10:12,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599297722] [2020-11-28 03:10:12,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:12,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:12,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678504710] [2020-11-28 03:10:12,855 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:10:12,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:12,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:12,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:12,856 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. cyclomatic complexity: 128 Second operand 3 states. [2020-11-28 03:10:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:12,882 INFO L93 Difference]: Finished difference Result 434 states and 658 transitions. [2020-11-28 03:10:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:12,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 658 transitions. [2020-11-28 03:10:12,888 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2020-11-28 03:10:12,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 658 transitions. [2020-11-28 03:10:12,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2020-11-28 03:10:12,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2020-11-28 03:10:12,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 658 transitions. [2020-11-28 03:10:12,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:10:12,897 INFO L691 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2020-11-28 03:10:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 658 transitions. [2020-11-28 03:10:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-11-28 03:10:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-11-28 03:10:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 658 transitions. [2020-11-28 03:10:12,919 INFO L714 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2020-11-28 03:10:12,919 INFO L594 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2020-11-28 03:10:12,920 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:10:12,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 658 transitions. [2020-11-28 03:10:12,923 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2020-11-28 03:10:12,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:10:12,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:10:12,924 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:10:12,924 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] [2020-11-28 03:10:12,924 INFO L794 eck$LassoCheckResult]: Stem: 1338#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1319#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_~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_~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;havoc main_~cond~0; 1320#L141-1 [2020-11-28 03:10:12,924 INFO L796 eck$LassoCheckResult]: Loop: 1320#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 1501#L40 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; 1499#L63 assume !(0 != main_~p1~0); 1497#L63-2 assume !(0 != main_~p2~0); 1494#L67-1 assume !(0 != main_~p3~0); 1491#L71-1 assume !(0 != main_~p4~0); 1492#L75-1 assume !(0 != main_~p5~0); 1474#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1475#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1458#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1459#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1438#L95-1 assume !(0 != main_~p1~0); 1439#L101-1 assume !(0 != main_~p2~0); 1424#L106-1 assume !(0 != main_~p3~0); 1423#L111-1 assume !(0 != main_~p4~0); 1514#L116-1 assume !(0 != main_~p5~0); 1513#L121-1 assume !(0 != main_~p6~0); 1510#L126-1 assume !(0 != main_~p7~0); 1507#L131-1 assume !(0 != main_~p8~0); 1504#L136-1 assume !(0 != main_~p9~0); 1320#L141-1 [2020-11-28 03:10:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:12,932 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-11-28 03:10:12,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:12,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309521292] [2020-11-28 03:10:12,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:12,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:12,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:12,979 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash -883800043, now seen corresponding path program 1 times [2020-11-28 03:10:12,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:12,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431689134] [2020-11-28 03:10:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:13,025 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:10:13,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431689134] [2020-11-28 03:10:13,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:13,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:13,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710638586] [2020-11-28 03:10:13,026 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:10:13,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:13,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:13,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:13,027 INFO L87 Difference]: Start difference. First operand 434 states and 658 transitions. cyclomatic complexity: 240 Second operand 3 states. [2020-11-28 03:10:13,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:13,047 INFO L93 Difference]: Finished difference Result 850 states and 1266 transitions. [2020-11-28 03:10:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:13,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 1266 transitions. [2020-11-28 03:10:13,057 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2020-11-28 03:10:13,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 850 states and 1266 transitions. [2020-11-28 03:10:13,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 850 [2020-11-28 03:10:13,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 850 [2020-11-28 03:10:13,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1266 transitions. [2020-11-28 03:10:13,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:10:13,068 INFO L691 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2020-11-28 03:10:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1266 transitions. [2020-11-28 03:10:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2020-11-28 03:10:13,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2020-11-28 03:10:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1266 transitions. [2020-11-28 03:10:13,094 INFO L714 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2020-11-28 03:10:13,095 INFO L594 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2020-11-28 03:10:13,095 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 03:10:13,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1266 transitions. [2020-11-28 03:10:13,101 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2020-11-28 03:10:13,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:10:13,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:10:13,102 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:10:13,102 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] [2020-11-28 03:10:13,102 INFO L794 eck$LassoCheckResult]: Stem: 2627#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2611#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_~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_~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;havoc main_~cond~0; 2612#L141-1 [2020-11-28 03:10:13,102 INFO L796 eck$LassoCheckResult]: Loop: 2612#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 2649#L40 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; 2650#L63 assume !(0 != main_~p1~0); 2766#L63-2 assume !(0 != main_~p2~0); 2760#L67-1 assume !(0 != main_~p3~0); 2752#L71-1 assume !(0 != main_~p4~0); 2745#L75-1 assume !(0 != main_~p5~0); 2746#L79-1 assume !(0 != main_~p6~0); 2734#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2729#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2722#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2723#L95-1 assume !(0 != main_~p1~0); 2834#L101-1 assume !(0 != main_~p2~0); 2836#L106-1 assume !(0 != main_~p3~0); 2843#L111-1 assume !(0 != main_~p4~0); 2841#L116-1 assume !(0 != main_~p5~0); 2842#L121-1 assume !(0 != main_~p6~0); 2893#L126-1 assume !(0 != main_~p7~0); 2659#L131-1 assume !(0 != main_~p8~0); 2655#L136-1 assume !(0 != main_~p9~0); 2612#L141-1 [2020-11-28 03:10:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-11-28 03:10:13,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:13,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555100680] [2020-11-28 03:10:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:13,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:13,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:13,124 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1470606057, now seen corresponding path program 1 times [2020-11-28 03:10:13,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:13,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781004217] [2020-11-28 03:10:13,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:13,170 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:10:13,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781004217] [2020-11-28 03:10:13,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:13,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:13,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408488881] [2020-11-28 03:10:13,171 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:10:13,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:13,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:13,172 INFO L87 Difference]: Start difference. First operand 850 states and 1266 transitions. cyclomatic complexity: 448 Second operand 3 states. [2020-11-28 03:10:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:13,211 INFO L93 Difference]: Finished difference Result 1666 states and 2434 transitions. [2020-11-28 03:10:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:13,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1666 states and 2434 transitions. [2020-11-28 03:10:13,241 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2020-11-28 03:10:13,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1666 states to 1666 states and 2434 transitions. [2020-11-28 03:10:13,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1666 [2020-11-28 03:10:13,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1666 [2020-11-28 03:10:13,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1666 states and 2434 transitions. [2020-11-28 03:10:13,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:10:13,262 INFO L691 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2020-11-28 03:10:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states and 2434 transitions. [2020-11-28 03:10:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2020-11-28 03:10:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1666 states. [2020-11-28 03:10:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2434 transitions. [2020-11-28 03:10:13,320 INFO L714 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2020-11-28 03:10:13,320 INFO L594 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2020-11-28 03:10:13,320 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 03:10:13,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1666 states and 2434 transitions. [2020-11-28 03:10:13,333 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2020-11-28 03:10:13,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:10:13,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:10:13,334 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:10:13,335 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] [2020-11-28 03:10:13,335 INFO L794 eck$LassoCheckResult]: Stem: 5153#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5133#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_~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_~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;havoc main_~cond~0; 5134#L141-1 [2020-11-28 03:10:13,335 INFO L796 eck$LassoCheckResult]: Loop: 5134#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 5490#L40 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; 5486#L63 assume !(0 != main_~p1~0); 5487#L63-2 assume !(0 != main_~p2~0); 5489#L67-1 assume !(0 != main_~p3~0); 5484#L71-1 assume !(0 != main_~p4~0); 5478#L75-1 assume !(0 != main_~p5~0); 5479#L79-1 assume !(0 != main_~p6~0); 5453#L83-1 assume !(0 != main_~p7~0); 5455#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5444#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5445#L95-1 assume !(0 != main_~p1~0); 5450#L101-1 assume !(0 != main_~p2~0); 5452#L106-1 assume !(0 != main_~p3~0); 5429#L111-1 assume !(0 != main_~p4~0); 5430#L116-1 assume !(0 != main_~p5~0); 5506#L121-1 assume !(0 != main_~p6~0); 5502#L126-1 assume !(0 != main_~p7~0); 5499#L131-1 assume !(0 != main_~p8~0); 5495#L136-1 assume !(0 != main_~p9~0); 5134#L141-1 [2020-11-28 03:10:13,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:13,336 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-11-28 03:10:13,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:13,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124267361] [2020-11-28 03:10:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:13,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:13,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:13,386 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:13,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1212440619, now seen corresponding path program 1 times [2020-11-28 03:10:13,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:13,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927585117] [2020-11-28 03:10:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:13,413 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:10:13,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927585117] [2020-11-28 03:10:13,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:13,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:13,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492198437] [2020-11-28 03:10:13,414 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:10:13,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:13,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:13,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:13,416 INFO L87 Difference]: Start difference. First operand 1666 states and 2434 transitions. cyclomatic complexity: 832 Second operand 3 states. [2020-11-28 03:10:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:13,458 INFO L93 Difference]: Finished difference Result 3266 states and 4674 transitions. [2020-11-28 03:10:13,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:13,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3266 states and 4674 transitions. [2020-11-28 03:10:13,499 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2020-11-28 03:10:13,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3266 states to 3266 states and 4674 transitions. [2020-11-28 03:10:13,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3266 [2020-11-28 03:10:13,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3266 [2020-11-28 03:10:13,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3266 states and 4674 transitions. [2020-11-28 03:10:13,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:10:13,543 INFO L691 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2020-11-28 03:10:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states and 4674 transitions. [2020-11-28 03:10:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2020-11-28 03:10:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3266 states. [2020-11-28 03:10:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4674 transitions. [2020-11-28 03:10:13,624 INFO L714 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2020-11-28 03:10:13,625 INFO L594 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2020-11-28 03:10:13,625 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 03:10:13,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3266 states and 4674 transitions. [2020-11-28 03:10:13,646 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2020-11-28 03:10:13,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:10:13,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:10:13,647 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:10:13,647 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] [2020-11-28 03:10:13,647 INFO L794 eck$LassoCheckResult]: Stem: 10084#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10067#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_~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_~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;havoc main_~cond~0; 10068#L141-1 [2020-11-28 03:10:13,648 INFO L796 eck$LassoCheckResult]: Loop: 10068#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 10247#L40 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; 10243#L63 assume !(0 != main_~p1~0); 10240#L63-2 assume !(0 != main_~p2~0); 10238#L67-1 assume !(0 != main_~p3~0); 10233#L71-1 assume !(0 != main_~p4~0); 10227#L75-1 assume !(0 != main_~p5~0); 10220#L79-1 assume !(0 != main_~p6~0); 10212#L83-1 assume !(0 != main_~p7~0); 10206#L87-1 assume !(0 != main_~p8~0); 10202#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 10197#L95-1 assume !(0 != main_~p1~0); 10193#L101-1 assume !(0 != main_~p2~0); 10195#L106-1 assume !(0 != main_~p3~0); 10275#L111-1 assume !(0 != main_~p4~0); 10272#L116-1 assume !(0 != main_~p5~0); 10267#L121-1 assume !(0 != main_~p6~0); 10262#L126-1 assume !(0 != main_~p7~0); 10259#L131-1 assume !(0 != main_~p8~0); 10252#L136-1 assume !(0 != main_~p9~0); 10068#L141-1 [2020-11-28 03:10:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:13,648 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-11-28 03:10:13,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:13,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974417371] [2020-11-28 03:10:13,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:13,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:13,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:13,683 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:13,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:13,684 INFO L82 PathProgramCache]: Analyzing trace with hash -511376041, now seen corresponding path program 1 times [2020-11-28 03:10:13,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:13,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203923359] [2020-11-28 03:10:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:13,714 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:10:13,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203923359] [2020-11-28 03:10:13,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:13,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:10:13,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74211894] [2020-11-28 03:10:13,715 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:10:13,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:13,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:13,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:13,716 INFO L87 Difference]: Start difference. First operand 3266 states and 4674 transitions. cyclomatic complexity: 1536 Second operand 3 states. [2020-11-28 03:10:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:13,795 INFO L93 Difference]: Finished difference Result 6402 states and 8962 transitions. [2020-11-28 03:10:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:13,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6402 states and 8962 transitions. [2020-11-28 03:10:13,869 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2020-11-28 03:10:13,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6402 states to 6402 states and 8962 transitions. [2020-11-28 03:10:13,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6402 [2020-11-28 03:10:13,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6402 [2020-11-28 03:10:13,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6402 states and 8962 transitions. [2020-11-28 03:10:13,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:10:13,938 INFO L691 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2020-11-28 03:10:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states and 8962 transitions. [2020-11-28 03:10:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6402. [2020-11-28 03:10:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6402 states. [2020-11-28 03:10:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 8962 transitions. [2020-11-28 03:10:14,086 INFO L714 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2020-11-28 03:10:14,086 INFO L594 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2020-11-28 03:10:14,086 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-28 03:10:14,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6402 states and 8962 transitions. [2020-11-28 03:10:14,114 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2020-11-28 03:10:14,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:10:14,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:10:14,116 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:10:14,116 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] [2020-11-28 03:10:14,116 INFO L794 eck$LassoCheckResult]: Stem: 19769#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 19744#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_~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_~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;havoc main_~cond~0; 19745#L141-1 [2020-11-28 03:10:14,117 INFO L796 eck$LassoCheckResult]: Loop: 19745#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 19860#L40 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; 19856#L63 assume !(0 != main_~p1~0); 19854#L63-2 assume !(0 != main_~p2~0); 19852#L67-1 assume !(0 != main_~p3~0); 19848#L71-1 assume !(0 != main_~p4~0); 19844#L75-1 assume !(0 != main_~p5~0); 19840#L79-1 assume !(0 != main_~p6~0); 19836#L83-1 assume !(0 != main_~p7~0); 19832#L87-1 assume !(0 != main_~p8~0); 19828#L91-1 assume !(0 != main_~p9~0); 19824#L95-1 assume !(0 != main_~p1~0); 19822#L101-1 assume !(0 != main_~p2~0); 19818#L106-1 assume !(0 != main_~p3~0); 19817#L111-1 assume !(0 != main_~p4~0); 19879#L116-1 assume !(0 != main_~p5~0); 19875#L121-1 assume !(0 != main_~p6~0); 19871#L126-1 assume !(0 != main_~p7~0); 19867#L131-1 assume !(0 != main_~p8~0); 19863#L136-1 assume !(0 != main_~p9~0); 19745#L141-1 [2020-11-28 03:10:14,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:14,118 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-11-28 03:10:14,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:14,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189108873] [2020-11-28 03:10:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:14,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:14,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:14,146 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash -904403051, now seen corresponding path program 1 times [2020-11-28 03:10:14,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:14,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871020011] [2020-11-28 03:10:14,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:14,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:14,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:14,175 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:14,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:14,176 INFO L82 PathProgramCache]: Analyzing trace with hash 551712343, now seen corresponding path program 1 times [2020-11-28 03:10:14,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:14,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019443989] [2020-11-28 03:10:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:14,183 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:14,204 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:14,210 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:14,638 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-11-28 03:10:14,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:10:14 BoogieIcfgContainer [2020-11-28 03:10:14,773 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:10:14,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:10:14,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:10:14,774 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:10:14,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:10:12" (3/4) ... [2020-11-28 03:10:14,778 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-28 03:10:14,845 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f9952eeb-1e03-4571-964b-bc9926f5485e/bin/uautomizer/witness.graphml [2020-11-28 03:10:14,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:10:14,847 INFO L168 Benchmark]: Toolchain (without parser) took 3721.95 ms. Allocated memory was 107.0 MB in the beginning and 159.4 MB in the end (delta: 52.4 MB). Free memory was 78.5 MB in the beginning and 70.0 MB in the end (delta: 8.5 MB). Peak memory consumption was 59.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:14,850 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 107.0 MB. Free memory is still 63.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:10:14,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.36 ms. Allocated memory was 107.0 MB in the beginning and 132.1 MB in the end (delta: 25.2 MB). Free memory was 78.2 MB in the beginning and 106.6 MB in the end (delta: -28.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:14,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.45 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 105.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:14,852 INFO L168 Benchmark]: Boogie Preprocessor took 23.12 ms. Allocated memory is still 132.1 MB. Free memory was 105.4 MB in the beginning and 104.1 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:10:14,852 INFO L168 Benchmark]: RCFGBuilder took 547.59 ms. Allocated memory is still 132.1 MB. Free memory was 103.7 MB in the beginning and 85.6 MB in the end (delta: 18.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:14,854 INFO L168 Benchmark]: BuchiAutomizer took 2757.77 ms. Allocated memory was 132.1 MB in the beginning and 159.4 MB in the end (delta: 27.3 MB). Free memory was 85.6 MB in the beginning and 73.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 80.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:14,855 INFO L168 Benchmark]: Witness Printer took 72.16 ms. Allocated memory is still 159.4 MB. Free memory was 73.1 MB in the beginning and 70.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:10:14,857 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.33 ms. Allocated memory is still 107.0 MB. Free memory is still 63.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 256.36 ms. Allocated memory was 107.0 MB in the beginning and 132.1 MB in the end (delta: 25.2 MB). Free memory was 78.2 MB in the beginning and 106.6 MB in the end (delta: -28.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.45 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 105.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.12 ms. Allocated memory is still 132.1 MB. Free memory was 105.4 MB in the beginning and 104.1 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 547.59 ms. Allocated memory is still 132.1 MB. Free memory was 103.7 MB in the beginning and 85.6 MB in the end (delta: 18.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2757.77 ms. Allocated memory was 132.1 MB in the beginning and 159.4 MB in the end (delta: 27.3 MB). Free memory was 85.6 MB in the beginning and 73.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 80.3 MB. Max. memory is 16.1 GB. * Witness Printer took 72.16 ms. Allocated memory is still 159.4 MB. Free memory was 73.1 MB in the beginning and 70.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6402 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 6402 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 583 SDtfs, 301 SDslu, 356 SDs, 0 SdLazy, 40 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI8 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: 38]: 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, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69b44613=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26513465=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16d9cc7c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d4cf8fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4603a398=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b758666=14, cond=14, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@695e5521=0, NULL=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@313cce5a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bdd4b99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@192c19=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: 38]: 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; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...