./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.24-cad4683 [2019-11-16 00:39:23,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:39:23,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:39:23,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:39:23,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:39:23,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:39:23,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:39:23,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:39:23,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:39:23,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:39:23,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:39:23,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:39:23,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:39:23,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:39:23,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:39:23,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:39:23,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:39:23,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:39:23,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:39:23,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:39:23,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:39:23,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:39:23,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:39:23,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:39:23,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:39:23,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:39:23,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:39:23,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:39:23,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:39:23,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:39:23,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:39:23,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:39:23,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:39:23,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:39:23,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:39:23,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:39:23,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:39:23,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:39:23,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:39:23,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:39:23,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:39:23,959 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:39:23,977 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:39:23,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:39:23,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:39:23,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:39:23,979 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:39:23,979 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:39:23,980 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:39:23,980 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:39:23,980 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:39:23,981 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:39:23,981 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:39:23,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:39:23,982 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:39:23,982 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:39:23,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:39:23,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:39:23,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:39:23,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:39:23,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:39:23,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:39:23,984 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:39:23,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:39:23,984 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:39:23,985 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:39:23,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:39:23,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:39:23,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:39:23,986 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:39:23,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:39:23,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:39:23,987 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:39:23,988 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:39:23,988 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2019-11-16 00:39:24,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:39:24,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:39:24,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:39:24,035 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:39:24,035 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:39:24,036 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_13.c [2019-11-16 00:39:24,093 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/bin/uautomizer/data/c4bacd4e9/83627e8993a64e1880fb3df2869203bf/FLAGfb0fdb927 [2019-11-16 00:39:24,521 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:39:24,522 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/sv-benchmarks/c/locks/test_locks_13.c [2019-11-16 00:39:24,530 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/bin/uautomizer/data/c4bacd4e9/83627e8993a64e1880fb3df2869203bf/FLAGfb0fdb927 [2019-11-16 00:39:24,950 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/bin/uautomizer/data/c4bacd4e9/83627e8993a64e1880fb3df2869203bf [2019-11-16 00:39:24,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:39:24,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:39:24,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:39:24,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:39:24,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:39:24,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:24" (1/1) ... [2019-11-16 00:39:24,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1d998b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:24, skipping insertion in model container [2019-11-16 00:39:24,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:24" (1/1) ... [2019-11-16 00:39:24,981 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:39:25,017 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:39:25,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:39:25,319 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:39:25,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:39:25,362 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:39:25,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25 WrapperNode [2019-11-16 00:39:25,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:39:25,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:39:25,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:39:25,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:39:25,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25" (1/1) ... [2019-11-16 00:39:25,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25" (1/1) ... [2019-11-16 00:39:25,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:39:25,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:39:25,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:39:25,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:39:25,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25" (1/1) ... [2019-11-16 00:39:25,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25" (1/1) ... [2019-11-16 00:39:25,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25" (1/1) ... [2019-11-16 00:39:25,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25" (1/1) ... [2019-11-16 00:39:25,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25" (1/1) ... [2019-11-16 00:39:25,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25" (1/1) ... [2019-11-16 00:39:25,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25" (1/1) ... [2019-11-16 00:39:25,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:39:25,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:39:25,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:39:25,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:39:25,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/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 [2019-11-16 00:39:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:39:25,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:39:25,849 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:39:25,850 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:39:25,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:25 BoogieIcfgContainer [2019-11-16 00:39:25,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:39:25,852 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:39:25,852 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:39:25,855 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:39:25,856 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:25,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:39:24" (1/3) ... [2019-11-16 00:39:25,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ea2899b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:39:25, skipping insertion in model container [2019-11-16 00:39:25,858 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:25,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25" (2/3) ... [2019-11-16 00:39:25,859 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ea2899b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:39:25, skipping insertion in model container [2019-11-16 00:39:25,859 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:25,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:25" (3/3) ... [2019-11-16 00:39:25,861 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2019-11-16 00:39:25,943 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:39:25,957 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:39:25,958 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:39:25,958 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:39:25,958 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:39:25,958 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:39:25,958 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:39:25,959 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:39:25,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2019-11-16 00:39:26,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2019-11-16 00:39:26,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:26,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:26,019 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:26,019 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:26,020 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:39:26,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2019-11-16 00:39:26,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2019-11-16 00:39:26,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:26,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:26,028 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:26,029 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:26,037 INFO L791 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 23#L195-1true [2019-11-16 00:39:26,041 INFO L793 eck$LassoCheckResult]: Loop: 23#L195-1true assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 33#L50true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 30#L81true assume 0 != main_~p1~0;main_~lk1~0 := 1; 27#L81-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 37#L85-1true assume !(0 != main_~p3~0); 24#L89-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 8#L93-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 41#L97-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 47#L101-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 34#L105-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 20#L109-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 5#L113-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 13#L117-1true assume !(0 != main_~p11~0); 44#L121-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 31#L125-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 16#L129-1true assume !(0 != main_~p1~0); 6#L135-1true assume !(0 != main_~p2~0); 17#L140-1true assume !(0 != main_~p3~0); 28#L145-1true assume !(0 != main_~p4~0); 38#L150-1true assume !(0 != main_~p5~0); 3#L155-1true assume !(0 != main_~p6~0); 14#L160-1true assume !(0 != main_~p7~0); 48#L165-1true assume !(0 != main_~p8~0); 12#L170-1true assume !(0 != main_~p9~0); 26#L175-1true assume !(0 != main_~p10~0); 36#L180-1true assume !(0 != main_~p11~0); 45#L185-1true assume !(0 != main_~p12~0); 10#L190-1true assume !(0 != main_~p13~0); 23#L195-1true [2019-11-16 00:39:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-16 00:39:26,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:26,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390975388] [2019-11-16 00:39:26,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:26,212 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:26,214 INFO L82 PathProgramCache]: Analyzing trace with hash -391818443, now seen corresponding path program 1 times [2019-11-16 00:39:26,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:26,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156616104] [2019-11-16 00:39:26,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:26,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156616104] [2019-11-16 00:39:26,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:26,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:26,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830954865] [2019-11-16 00:39:26,365 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:26,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:26,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:26,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:26,385 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-11-16 00:39:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:26,444 INFO L93 Difference]: Finished difference Result 92 states and 165 transitions. [2019-11-16 00:39:26,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:26,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 165 transitions. [2019-11-16 00:39:26,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-11-16 00:39:26,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 82 states and 132 transitions. [2019-11-16 00:39:26,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2019-11-16 00:39:26,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2019-11-16 00:39:26,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 132 transitions. [2019-11-16 00:39:26,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:26,475 INFO L688 BuchiCegarLoop]: Abstraction has 82 states and 132 transitions. [2019-11-16 00:39:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 132 transitions. [2019-11-16 00:39:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-11-16 00:39:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-16 00:39:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 132 transitions. [2019-11-16 00:39:26,525 INFO L711 BuchiCegarLoop]: Abstraction has 82 states and 132 transitions. [2019-11-16 00:39:26,526 INFO L591 BuchiCegarLoop]: Abstraction has 82 states and 132 transitions. [2019-11-16 00:39:26,526 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:39:26,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 132 transitions. [2019-11-16 00:39:26,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-11-16 00:39:26,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:26,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:26,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:26,530 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:26,530 INFO L791 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 199#L195-1 [2019-11-16 00:39:26,530 INFO L793 eck$LassoCheckResult]: Loop: 199#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 191#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 192#L81 assume !(0 != main_~p1~0); 205#L81-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 229#L85-1 assume !(0 != main_~p3~0); 228#L89-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 227#L93-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 226#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 225#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 193#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 194#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 224#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 223#L117-1 assume !(0 != main_~p11~0); 202#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 203#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 222#L129-1 assume !(0 != main_~p1~0); 155#L135-1 assume !(0 != main_~p2~0); 156#L140-1 assume !(0 != main_~p3~0); 186#L145-1 assume !(0 != main_~p4~0); 179#L150-1 assume !(0 != main_~p5~0); 150#L155-1 assume !(0 != main_~p6~0); 152#L160-1 assume !(0 != main_~p7~0); 159#L165-1 assume !(0 != main_~p8~0); 176#L170-1 assume !(0 != main_~p9~0); 211#L175-1 assume !(0 != main_~p10~0); 196#L180-1 assume !(0 != main_~p11~0); 149#L185-1 assume !(0 != main_~p12~0); 207#L190-1 assume !(0 != main_~p13~0); 199#L195-1 [2019-11-16 00:39:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:26,531 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-16 00:39:26,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:26,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58341574] [2019-11-16 00:39:26,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:26,544 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash -329778829, now seen corresponding path program 1 times [2019-11-16 00:39:26,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:26,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727481610] [2019-11-16 00:39:26,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:26,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727481610] [2019-11-16 00:39:26,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:26,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:26,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741745840] [2019-11-16 00:39:26,607 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:26,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:26,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:26,608 INFO L87 Difference]: Start difference. First operand 82 states and 132 transitions. cyclomatic complexity: 52 Second operand 3 states. [2019-11-16 00:39:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:26,661 INFO L93 Difference]: Finished difference Result 161 states and 257 transitions. [2019-11-16 00:39:26,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:26,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 257 transitions. [2019-11-16 00:39:26,667 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2019-11-16 00:39:26,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 161 states and 257 transitions. [2019-11-16 00:39:26,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2019-11-16 00:39:26,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2019-11-16 00:39:26,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 257 transitions. [2019-11-16 00:39:26,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:26,675 INFO L688 BuchiCegarLoop]: Abstraction has 161 states and 257 transitions. [2019-11-16 00:39:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 257 transitions. [2019-11-16 00:39:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-11-16 00:39:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-16 00:39:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 257 transitions. [2019-11-16 00:39:26,690 INFO L711 BuchiCegarLoop]: Abstraction has 161 states and 257 transitions. [2019-11-16 00:39:26,690 INFO L591 BuchiCegarLoop]: Abstraction has 161 states and 257 transitions. [2019-11-16 00:39:26,691 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:39:26,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 257 transitions. [2019-11-16 00:39:26,694 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2019-11-16 00:39:26,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:26,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:26,695 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:26,696 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:26,696 INFO L791 eck$LassoCheckResult]: Stem: 443#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 444#L195-1 [2019-11-16 00:39:26,696 INFO L793 eck$LassoCheckResult]: Loop: 444#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 456#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 453#L81 assume !(0 != main_~p1~0); 454#L81-2 assume !(0 != main_~p2~0); 517#L85-1 assume !(0 != main_~p3~0); 516#L89-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 515#L93-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 514#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 513#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 512#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 511#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 510#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 509#L117-1 assume !(0 != main_~p11~0); 508#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 507#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 505#L129-1 assume !(0 != main_~p1~0); 503#L135-1 assume !(0 != main_~p2~0); 501#L140-1 assume !(0 != main_~p3~0); 497#L145-1 assume !(0 != main_~p4~0); 493#L150-1 assume !(0 != main_~p5~0); 489#L155-1 assume !(0 != main_~p6~0); 485#L160-1 assume !(0 != main_~p7~0); 481#L165-1 assume !(0 != main_~p8~0); 477#L170-1 assume !(0 != main_~p9~0); 473#L175-1 assume !(0 != main_~p10~0); 469#L180-1 assume !(0 != main_~p11~0); 464#L185-1 assume !(0 != main_~p12~0); 461#L190-1 assume !(0 != main_~p13~0); 444#L195-1 [2019-11-16 00:39:26,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:26,697 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-16 00:39:26,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:26,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807714182] [2019-11-16 00:39:26,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:26,710 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:26,711 INFO L82 PathProgramCache]: Analyzing trace with hash -189230219, now seen corresponding path program 1 times [2019-11-16 00:39:26,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:26,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779978604] [2019-11-16 00:39:26,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:26,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779978604] [2019-11-16 00:39:26,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:26,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:26,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884144087] [2019-11-16 00:39:26,750 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:26,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:26,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:26,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:26,750 INFO L87 Difference]: Start difference. First operand 161 states and 257 transitions. cyclomatic complexity: 100 Second operand 3 states. [2019-11-16 00:39:26,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:26,784 INFO L93 Difference]: Finished difference Result 317 states and 501 transitions. [2019-11-16 00:39:26,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:26,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 501 transitions. [2019-11-16 00:39:26,791 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2019-11-16 00:39:26,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 317 states and 501 transitions. [2019-11-16 00:39:26,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2019-11-16 00:39:26,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2019-11-16 00:39:26,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 501 transitions. [2019-11-16 00:39:26,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:26,800 INFO L688 BuchiCegarLoop]: Abstraction has 317 states and 501 transitions. [2019-11-16 00:39:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 501 transitions. [2019-11-16 00:39:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2019-11-16 00:39:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-16 00:39:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 501 transitions. [2019-11-16 00:39:26,823 INFO L711 BuchiCegarLoop]: Abstraction has 317 states and 501 transitions. [2019-11-16 00:39:26,823 INFO L591 BuchiCegarLoop]: Abstraction has 317 states and 501 transitions. [2019-11-16 00:39:26,824 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:39:26,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 501 transitions. [2019-11-16 00:39:26,827 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2019-11-16 00:39:26,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:26,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:26,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:26,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:26,828 INFO L791 eck$LassoCheckResult]: Stem: 929#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 930#L195-1 [2019-11-16 00:39:26,828 INFO L793 eck$LassoCheckResult]: Loop: 930#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 975#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 973#L81 assume !(0 != main_~p1~0); 969#L81-2 assume !(0 != main_~p2~0); 967#L85-1 assume !(0 != main_~p3~0); 964#L89-1 assume !(0 != main_~p4~0); 962#L93-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 960#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 958#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 956#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 954#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 952#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 950#L117-1 assume !(0 != main_~p11~0); 948#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 946#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 943#L129-1 assume !(0 != main_~p1~0); 944#L135-1 assume !(0 != main_~p2~0); 1019#L140-1 assume !(0 != main_~p3~0); 1014#L145-1 assume !(0 != main_~p4~0); 1011#L150-1 assume !(0 != main_~p5~0); 1007#L155-1 assume !(0 != main_~p6~0); 1003#L160-1 assume !(0 != main_~p7~0); 999#L165-1 assume !(0 != main_~p8~0); 995#L170-1 assume !(0 != main_~p9~0); 991#L175-1 assume !(0 != main_~p10~0); 987#L180-1 assume !(0 != main_~p11~0); 982#L185-1 assume !(0 != main_~p12~0); 979#L190-1 assume !(0 != main_~p13~0); 930#L195-1 [2019-11-16 00:39:26,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:26,829 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-16 00:39:26,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:26,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571616473] [2019-11-16 00:39:26,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:26,841 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:26,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:26,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1994668553, now seen corresponding path program 1 times [2019-11-16 00:39:26,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:26,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607410946] [2019-11-16 00:39:26,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:26,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607410946] [2019-11-16 00:39:26,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:26,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:26,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958868746] [2019-11-16 00:39:26,884 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:26,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:26,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:26,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:26,885 INFO L87 Difference]: Start difference. First operand 317 states and 501 transitions. cyclomatic complexity: 192 Second operand 3 states. [2019-11-16 00:39:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:26,910 INFO L93 Difference]: Finished difference Result 625 states and 977 transitions. [2019-11-16 00:39:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:26,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 625 states and 977 transitions. [2019-11-16 00:39:26,922 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2019-11-16 00:39:26,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 625 states to 625 states and 977 transitions. [2019-11-16 00:39:26,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 625 [2019-11-16 00:39:26,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 625 [2019-11-16 00:39:26,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 625 states and 977 transitions. [2019-11-16 00:39:26,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:26,936 INFO L688 BuchiCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-11-16 00:39:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states and 977 transitions. [2019-11-16 00:39:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-11-16 00:39:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-11-16 00:39:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 977 transitions. [2019-11-16 00:39:26,966 INFO L711 BuchiCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-11-16 00:39:26,966 INFO L591 BuchiCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-11-16 00:39:26,967 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:39:26,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 625 states and 977 transitions. [2019-11-16 00:39:26,972 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2019-11-16 00:39:26,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:26,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:26,973 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:26,973 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:26,973 INFO L791 eck$LassoCheckResult]: Stem: 1873#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 1874#L195-1 [2019-11-16 00:39:26,982 INFO L793 eck$LassoCheckResult]: Loop: 1874#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 2094#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 2093#L81 assume !(0 != main_~p1~0); 2090#L81-2 assume !(0 != main_~p2~0); 2091#L85-1 assume !(0 != main_~p3~0); 2166#L89-1 assume !(0 != main_~p4~0); 2167#L93-1 assume !(0 != main_~p5~0); 2172#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2147#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2146#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2145#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2143#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2142#L117-1 assume !(0 != main_~p11~0); 2139#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2136#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2132#L129-1 assume !(0 != main_~p1~0); 2129#L135-1 assume !(0 != main_~p2~0); 2126#L140-1 assume !(0 != main_~p3~0); 2122#L145-1 assume !(0 != main_~p4~0); 2118#L150-1 assume !(0 != main_~p5~0); 2115#L155-1 assume !(0 != main_~p6~0); 2111#L160-1 assume !(0 != main_~p7~0); 2108#L165-1 assume !(0 != main_~p8~0); 2105#L170-1 assume !(0 != main_~p9~0); 2102#L175-1 assume !(0 != main_~p10~0); 2100#L180-1 assume !(0 != main_~p11~0); 2097#L185-1 assume !(0 != main_~p12~0); 2096#L190-1 assume !(0 != main_~p13~0); 1874#L195-1 [2019-11-16 00:39:26,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:26,982 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-16 00:39:26,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:26,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079331874] [2019-11-16 00:39:26,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:26,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:26,993 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1775813835, now seen corresponding path program 1 times [2019-11-16 00:39:27,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:27,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169318023] [2019-11-16 00:39:27,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:27,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169318023] [2019-11-16 00:39:27,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:27,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:27,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325663559] [2019-11-16 00:39:27,093 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:27,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:27,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:27,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:27,095 INFO L87 Difference]: Start difference. First operand 625 states and 977 transitions. cyclomatic complexity: 368 Second operand 3 states. [2019-11-16 00:39:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:27,129 INFO L93 Difference]: Finished difference Result 1233 states and 1905 transitions. [2019-11-16 00:39:27,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:27,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1233 states and 1905 transitions. [2019-11-16 00:39:27,148 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2019-11-16 00:39:27,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1233 states to 1233 states and 1905 transitions. [2019-11-16 00:39:27,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1233 [2019-11-16 00:39:27,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1233 [2019-11-16 00:39:27,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1233 states and 1905 transitions. [2019-11-16 00:39:27,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:27,165 INFO L688 BuchiCegarLoop]: Abstraction has 1233 states and 1905 transitions. [2019-11-16 00:39:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states and 1905 transitions. [2019-11-16 00:39:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1233. [2019-11-16 00:39:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-11-16 00:39:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1905 transitions. [2019-11-16 00:39:27,201 INFO L711 BuchiCegarLoop]: Abstraction has 1233 states and 1905 transitions. [2019-11-16 00:39:27,201 INFO L591 BuchiCegarLoop]: Abstraction has 1233 states and 1905 transitions. [2019-11-16 00:39:27,201 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:39:27,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1233 states and 1905 transitions. [2019-11-16 00:39:27,209 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2019-11-16 00:39:27,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:27,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:27,212 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:27,212 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:27,213 INFO L791 eck$LassoCheckResult]: Stem: 3742#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 3743#L195-1 [2019-11-16 00:39:27,213 INFO L793 eck$LassoCheckResult]: Loop: 3743#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 3984#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 3980#L81 assume !(0 != main_~p1~0); 3975#L81-2 assume !(0 != main_~p2~0); 3973#L85-1 assume !(0 != main_~p3~0); 3969#L89-1 assume !(0 != main_~p4~0); 3933#L93-1 assume !(0 != main_~p5~0); 3935#L97-1 assume !(0 != main_~p6~0); 3957#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3956#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3955#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3954#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3953#L117-1 assume !(0 != main_~p11~0); 3952#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 3951#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 3949#L129-1 assume !(0 != main_~p1~0); 3950#L135-1 assume !(0 != main_~p2~0); 4027#L140-1 assume !(0 != main_~p3~0); 4023#L145-1 assume !(0 != main_~p4~0); 4021#L150-1 assume !(0 != main_~p5~0); 4017#L155-1 assume !(0 != main_~p6~0); 4014#L160-1 assume !(0 != main_~p7~0); 4010#L165-1 assume !(0 != main_~p8~0); 4006#L170-1 assume !(0 != main_~p9~0); 4002#L175-1 assume !(0 != main_~p10~0); 4000#L180-1 assume !(0 != main_~p11~0); 3994#L185-1 assume !(0 != main_~p12~0); 3990#L190-1 assume !(0 != main_~p13~0); 3743#L195-1 [2019-11-16 00:39:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-16 00:39:27,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:27,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207398066] [2019-11-16 00:39:27,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:27,240 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:27,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1353112009, now seen corresponding path program 1 times [2019-11-16 00:39:27,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:27,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558081131] [2019-11-16 00:39:27,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:27,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558081131] [2019-11-16 00:39:27,287 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:27,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:27,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598827535] [2019-11-16 00:39:27,287 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:27,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:27,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:27,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:27,288 INFO L87 Difference]: Start difference. First operand 1233 states and 1905 transitions. cyclomatic complexity: 704 Second operand 3 states. [2019-11-16 00:39:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:27,323 INFO L93 Difference]: Finished difference Result 2433 states and 3713 transitions. [2019-11-16 00:39:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:27,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2433 states and 3713 transitions. [2019-11-16 00:39:27,359 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2019-11-16 00:39:27,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2433 states to 2433 states and 3713 transitions. [2019-11-16 00:39:27,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2433 [2019-11-16 00:39:27,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2433 [2019-11-16 00:39:27,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2433 states and 3713 transitions. [2019-11-16 00:39:27,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:27,389 INFO L688 BuchiCegarLoop]: Abstraction has 2433 states and 3713 transitions. [2019-11-16 00:39:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states and 3713 transitions. [2019-11-16 00:39:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2019-11-16 00:39:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2019-11-16 00:39:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3713 transitions. [2019-11-16 00:39:27,447 INFO L711 BuchiCegarLoop]: Abstraction has 2433 states and 3713 transitions. [2019-11-16 00:39:27,447 INFO L591 BuchiCegarLoop]: Abstraction has 2433 states and 3713 transitions. [2019-11-16 00:39:27,447 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:39:27,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2433 states and 3713 transitions. [2019-11-16 00:39:27,463 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2019-11-16 00:39:27,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:27,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:27,464 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:27,465 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:27,465 INFO L791 eck$LassoCheckResult]: Stem: 7415#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 7416#L195-1 [2019-11-16 00:39:27,465 INFO L793 eck$LassoCheckResult]: Loop: 7416#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 8061#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 8059#L81 assume !(0 != main_~p1~0); 8057#L81-2 assume !(0 != main_~p2~0); 8056#L85-1 assume !(0 != main_~p3~0); 8052#L89-1 assume !(0 != main_~p4~0); 8048#L93-1 assume !(0 != main_~p5~0); 8046#L97-1 assume !(0 != main_~p6~0); 7726#L101-1 assume !(0 != main_~p7~0); 7727#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8041#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8040#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8039#L117-1 assume !(0 != main_~p11~0); 8038#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8037#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8036#L129-1 assume !(0 != main_~p1~0); 7915#L135-1 assume !(0 != main_~p2~0); 7817#L140-1 assume !(0 != main_~p3~0); 7816#L145-1 assume !(0 != main_~p4~0); 7912#L150-1 assume !(0 != main_~p5~0); 7910#L155-1 assume !(0 != main_~p6~0); 7911#L160-1 assume !(0 != main_~p7~0); 8227#L165-1 assume !(0 != main_~p8~0); 8223#L170-1 assume !(0 != main_~p9~0); 8219#L175-1 assume !(0 != main_~p10~0); 8215#L180-1 assume !(0 != main_~p11~0); 8210#L185-1 assume !(0 != main_~p12~0); 8208#L190-1 assume !(0 != main_~p13~0); 7416#L195-1 [2019-11-16 00:39:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:27,465 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-16 00:39:27,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:27,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862343573] [2019-11-16 00:39:27,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:27,485 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:27,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2124206837, now seen corresponding path program 1 times [2019-11-16 00:39:27,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:27,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226480311] [2019-11-16 00:39:27,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:27,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226480311] [2019-11-16 00:39:27,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:27,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:27,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595749402] [2019-11-16 00:39:27,524 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:27,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:27,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:27,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:27,525 INFO L87 Difference]: Start difference. First operand 2433 states and 3713 transitions. cyclomatic complexity: 1344 Second operand 3 states. [2019-11-16 00:39:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:27,561 INFO L93 Difference]: Finished difference Result 4801 states and 7233 transitions. [2019-11-16 00:39:27,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:27,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4801 states and 7233 transitions. [2019-11-16 00:39:27,599 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2019-11-16 00:39:27,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4801 states to 4801 states and 7233 transitions. [2019-11-16 00:39:27,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4801 [2019-11-16 00:39:27,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4801 [2019-11-16 00:39:27,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4801 states and 7233 transitions. [2019-11-16 00:39:27,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:27,654 INFO L688 BuchiCegarLoop]: Abstraction has 4801 states and 7233 transitions. [2019-11-16 00:39:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4801 states and 7233 transitions. [2019-11-16 00:39:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4801 to 4801. [2019-11-16 00:39:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2019-11-16 00:39:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 7233 transitions. [2019-11-16 00:39:27,783 INFO L711 BuchiCegarLoop]: Abstraction has 4801 states and 7233 transitions. [2019-11-16 00:39:27,783 INFO L591 BuchiCegarLoop]: Abstraction has 4801 states and 7233 transitions. [2019-11-16 00:39:27,783 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:39:27,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4801 states and 7233 transitions. [2019-11-16 00:39:27,813 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2019-11-16 00:39:27,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:27,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:27,814 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:27,814 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:27,814 INFO L791 eck$LassoCheckResult]: Stem: 14653#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 14654#L195-1 [2019-11-16 00:39:27,815 INFO L793 eck$LassoCheckResult]: Loop: 14654#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 14943#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 14940#L81 assume !(0 != main_~p1~0); 14936#L81-2 assume !(0 != main_~p2~0); 14933#L85-1 assume !(0 != main_~p3~0); 14930#L89-1 assume !(0 != main_~p4~0); 14931#L93-1 assume !(0 != main_~p5~0); 14868#L97-1 assume !(0 != main_~p6~0); 14869#L101-1 assume !(0 != main_~p7~0); 14851#L105-1 assume !(0 != main_~p8~0); 14853#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 14836#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 14837#L117-1 assume !(0 != main_~p11~0); 14822#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 14823#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 14804#L129-1 assume !(0 != main_~p1~0); 14806#L135-1 assume !(0 != main_~p2~0); 14787#L140-1 assume !(0 != main_~p3~0); 14786#L145-1 assume !(0 != main_~p4~0); 14973#L150-1 assume !(0 != main_~p5~0); 14970#L155-1 assume !(0 != main_~p6~0); 14968#L160-1 assume !(0 != main_~p7~0); 14966#L165-1 assume !(0 != main_~p8~0); 14964#L170-1 assume !(0 != main_~p9~0); 14960#L175-1 assume !(0 != main_~p10~0); 14956#L180-1 assume !(0 != main_~p11~0); 14951#L185-1 assume !(0 != main_~p12~0); 14948#L190-1 assume !(0 != main_~p13~0); 14654#L195-1 [2019-11-16 00:39:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-16 00:39:27,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:27,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220894220] [2019-11-16 00:39:27,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:27,825 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:27,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:27,826 INFO L82 PathProgramCache]: Analyzing trace with hash 435263095, now seen corresponding path program 1 times [2019-11-16 00:39:27,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:27,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279609194] [2019-11-16 00:39:27,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:27,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:27,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279609194] [2019-11-16 00:39:27,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:27,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:27,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239128087] [2019-11-16 00:39:27,849 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:27,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:27,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:27,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:27,850 INFO L87 Difference]: Start difference. First operand 4801 states and 7233 transitions. cyclomatic complexity: 2560 Second operand 3 states. [2019-11-16 00:39:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:27,933 INFO L93 Difference]: Finished difference Result 9473 states and 14081 transitions. [2019-11-16 00:39:27,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:27,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9473 states and 14081 transitions. [2019-11-16 00:39:28,001 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2019-11-16 00:39:28,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9473 states to 9473 states and 14081 transitions. [2019-11-16 00:39:28,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9473 [2019-11-16 00:39:28,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9473 [2019-11-16 00:39:28,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9473 states and 14081 transitions. [2019-11-16 00:39:28,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:28,110 INFO L688 BuchiCegarLoop]: Abstraction has 9473 states and 14081 transitions. [2019-11-16 00:39:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9473 states and 14081 transitions. [2019-11-16 00:39:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9473 to 9473. [2019-11-16 00:39:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9473 states. [2019-11-16 00:39:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9473 states to 9473 states and 14081 transitions. [2019-11-16 00:39:28,434 INFO L711 BuchiCegarLoop]: Abstraction has 9473 states and 14081 transitions. [2019-11-16 00:39:28,434 INFO L591 BuchiCegarLoop]: Abstraction has 9473 states and 14081 transitions. [2019-11-16 00:39:28,435 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:39:28,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9473 states and 14081 transitions. [2019-11-16 00:39:28,475 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2019-11-16 00:39:28,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:28,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:28,478 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:28,479 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:28,479 INFO L791 eck$LassoCheckResult]: Stem: 28929#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 28930#L195-1 [2019-11-16 00:39:28,480 INFO L793 eck$LassoCheckResult]: Loop: 28930#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 29188#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 29184#L81 assume !(0 != main_~p1~0); 29181#L81-2 assume !(0 != main_~p2~0); 29129#L85-1 assume !(0 != main_~p3~0); 29122#L89-1 assume !(0 != main_~p4~0); 29120#L93-1 assume !(0 != main_~p5~0); 29118#L97-1 assume !(0 != main_~p6~0); 29115#L101-1 assume !(0 != main_~p7~0); 29111#L105-1 assume !(0 != main_~p8~0); 29107#L109-1 assume !(0 != main_~p9~0); 29108#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 29245#L117-1 assume !(0 != main_~p11~0); 29244#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 29243#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 29241#L129-1 assume !(0 != main_~p1~0); 29239#L135-1 assume !(0 != main_~p2~0); 29238#L140-1 assume !(0 != main_~p3~0); 29235#L145-1 assume !(0 != main_~p4~0); 29233#L150-1 assume !(0 != main_~p5~0); 29232#L155-1 assume !(0 != main_~p6~0); 29230#L160-1 assume !(0 != main_~p7~0); 29228#L165-1 assume !(0 != main_~p8~0); 29229#L170-1 assume !(0 != main_~p9~0); 29267#L175-1 assume !(0 != main_~p10~0); 29265#L180-1 assume !(0 != main_~p11~0); 29256#L185-1 assume !(0 != main_~p12~0); 29193#L190-1 assume !(0 != main_~p13~0); 28930#L195-1 [2019-11-16 00:39:28,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-16 00:39:28,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:28,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254189663] [2019-11-16 00:39:28,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:28,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:28,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:28,504 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:28,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:28,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1558881611, now seen corresponding path program 1 times [2019-11-16 00:39:28,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:28,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996394448] [2019-11-16 00:39:28,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:28,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:28,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:28,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996394448] [2019-11-16 00:39:28,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:28,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:28,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864989459] [2019-11-16 00:39:28,546 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:28,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:28,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:28,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:28,546 INFO L87 Difference]: Start difference. First operand 9473 states and 14081 transitions. cyclomatic complexity: 4864 Second operand 3 states. [2019-11-16 00:39:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:28,614 INFO L93 Difference]: Finished difference Result 18689 states and 27393 transitions. [2019-11-16 00:39:28,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:28,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18689 states and 27393 transitions. [2019-11-16 00:39:28,737 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2019-11-16 00:39:28,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18689 states to 18689 states and 27393 transitions. [2019-11-16 00:39:28,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18689 [2019-11-16 00:39:28,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18689 [2019-11-16 00:39:28,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18689 states and 27393 transitions. [2019-11-16 00:39:28,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:28,864 INFO L688 BuchiCegarLoop]: Abstraction has 18689 states and 27393 transitions. [2019-11-16 00:39:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18689 states and 27393 transitions. [2019-11-16 00:39:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18689 to 18689. [2019-11-16 00:39:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18689 states. [2019-11-16 00:39:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18689 states to 18689 states and 27393 transitions. [2019-11-16 00:39:29,200 INFO L711 BuchiCegarLoop]: Abstraction has 18689 states and 27393 transitions. [2019-11-16 00:39:29,200 INFO L591 BuchiCegarLoop]: Abstraction has 18689 states and 27393 transitions. [2019-11-16 00:39:29,202 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:39:29,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18689 states and 27393 transitions. [2019-11-16 00:39:29,279 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2019-11-16 00:39:29,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:29,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:29,280 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:29,280 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:29,280 INFO L791 eck$LassoCheckResult]: Stem: 57102#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 57103#L195-1 [2019-11-16 00:39:29,282 INFO L793 eck$LassoCheckResult]: Loop: 57103#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 57672#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 57668#L81 assume !(0 != main_~p1~0); 57664#L81-2 assume !(0 != main_~p2~0); 57662#L85-1 assume !(0 != main_~p3~0); 57660#L89-1 assume !(0 != main_~p4~0); 57655#L93-1 assume !(0 != main_~p5~0); 57651#L97-1 assume !(0 != main_~p6~0); 57644#L101-1 assume !(0 != main_~p7~0); 57636#L105-1 assume !(0 != main_~p8~0); 57629#L109-1 assume !(0 != main_~p9~0); 57624#L113-1 assume !(0 != main_~p10~0); 57625#L117-1 assume !(0 != main_~p11~0); 57621#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 57617#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 57612#L129-1 assume !(0 != main_~p1~0); 57606#L135-1 assume !(0 != main_~p2~0); 57586#L140-1 assume !(0 != main_~p3~0); 57585#L145-1 assume !(0 != main_~p4~0); 57587#L150-1 assume !(0 != main_~p5~0); 57588#L155-1 assume !(0 != main_~p6~0); 57540#L160-1 assume !(0 != main_~p7~0); 57542#L165-1 assume !(0 != main_~p8~0); 57492#L170-1 assume !(0 != main_~p9~0); 57494#L175-1 assume !(0 != main_~p10~0); 57684#L180-1 assume !(0 != main_~p11~0); 57679#L185-1 assume !(0 != main_~p12~0); 57676#L190-1 assume !(0 != main_~p13~0); 57103#L195-1 [2019-11-16 00:39:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:29,282 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-16 00:39:29,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:29,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354812419] [2019-11-16 00:39:29,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:29,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:29,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:29,300 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:29,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:29,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1147737783, now seen corresponding path program 1 times [2019-11-16 00:39:29,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:29,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341297154] [2019-11-16 00:39:29,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:29,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:29,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:29,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341297154] [2019-11-16 00:39:29,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:29,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:29,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149356002] [2019-11-16 00:39:29,341 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:29,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:29,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:29,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:29,341 INFO L87 Difference]: Start difference. First operand 18689 states and 27393 transitions. cyclomatic complexity: 9216 Second operand 3 states. [2019-11-16 00:39:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:29,457 INFO L93 Difference]: Finished difference Result 36865 states and 53249 transitions. [2019-11-16 00:39:29,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:29,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36865 states and 53249 transitions. [2019-11-16 00:39:29,669 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2019-11-16 00:39:29,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36865 states to 36865 states and 53249 transitions. [2019-11-16 00:39:29,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36865 [2019-11-16 00:39:29,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36865 [2019-11-16 00:39:29,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36865 states and 53249 transitions. [2019-11-16 00:39:29,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:29,882 INFO L688 BuchiCegarLoop]: Abstraction has 36865 states and 53249 transitions. [2019-11-16 00:39:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36865 states and 53249 transitions. [2019-11-16 00:39:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36865 to 36865. [2019-11-16 00:39:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36865 states. [2019-11-16 00:39:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36865 states to 36865 states and 53249 transitions. [2019-11-16 00:39:30,657 INFO L711 BuchiCegarLoop]: Abstraction has 36865 states and 53249 transitions. [2019-11-16 00:39:30,658 INFO L591 BuchiCegarLoop]: Abstraction has 36865 states and 53249 transitions. [2019-11-16 00:39:30,658 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:39:30,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36865 states and 53249 transitions. [2019-11-16 00:39:30,775 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2019-11-16 00:39:30,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:30,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:30,776 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:30,776 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:30,776 INFO L791 eck$LassoCheckResult]: Stem: 112667#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 112668#L195-1 [2019-11-16 00:39:30,776 INFO L793 eck$LassoCheckResult]: Loop: 112668#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 113249#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 113250#L81 assume !(0 != main_~p1~0); 113230#L81-2 assume !(0 != main_~p2~0); 113220#L85-1 assume !(0 != main_~p3~0); 113221#L89-1 assume !(0 != main_~p4~0); 113327#L93-1 assume !(0 != main_~p5~0); 113326#L97-1 assume !(0 != main_~p6~0); 113323#L101-1 assume !(0 != main_~p7~0); 113312#L105-1 assume !(0 != main_~p8~0); 113310#L109-1 assume !(0 != main_~p9~0); 113307#L113-1 assume !(0 != main_~p10~0); 113304#L117-1 assume !(0 != main_~p11~0); 113302#L121-1 assume !(0 != main_~p12~0); 113292#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 113041#L129-1 assume !(0 != main_~p1~0); 113043#L135-1 assume !(0 != main_~p2~0); 113026#L140-1 assume !(0 != main_~p3~0); 113025#L145-1 assume !(0 != main_~p4~0); 113007#L150-1 assume !(0 != main_~p5~0); 113008#L155-1 assume !(0 != main_~p6~0); 112991#L160-1 assume !(0 != main_~p7~0); 112993#L165-1 assume !(0 != main_~p8~0); 112985#L170-1 assume !(0 != main_~p9~0); 112987#L175-1 assume !(0 != main_~p10~0); 112886#L180-1 assume !(0 != main_~p11~0); 112885#L185-1 assume !(0 != main_~p12~0); 113266#L190-1 assume !(0 != main_~p13~0); 112668#L195-1 [2019-11-16 00:39:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:30,777 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2019-11-16 00:39:30,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:30,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652052885] [2019-11-16 00:39:30,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:30,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:30,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:30,794 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:30,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:30,795 INFO L82 PathProgramCache]: Analyzing trace with hash -132125895, now seen corresponding path program 1 times [2019-11-16 00:39:30,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:30,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790669100] [2019-11-16 00:39:30,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:30,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:30,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:30,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790669100] [2019-11-16 00:39:30,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:30,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:39:30,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082668802] [2019-11-16 00:39:30,819 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:30,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:30,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:30,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:30,819 INFO L87 Difference]: Start difference. First operand 36865 states and 53249 transitions. cyclomatic complexity: 17408 Second operand 3 states. [2019-11-16 00:39:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:31,014 INFO L93 Difference]: Finished difference Result 72705 states and 103425 transitions. [2019-11-16 00:39:31,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:31,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72705 states and 103425 transitions. [2019-11-16 00:39:31,345 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2019-11-16 00:39:32,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72705 states to 72705 states and 103425 transitions. [2019-11-16 00:39:32,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72705 [2019-11-16 00:39:32,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72705 [2019-11-16 00:39:32,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72705 states and 103425 transitions. [2019-11-16 00:39:32,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:32,153 INFO L688 BuchiCegarLoop]: Abstraction has 72705 states and 103425 transitions. [2019-11-16 00:39:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72705 states and 103425 transitions. [2019-11-16 00:39:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72705 to 72705. [2019-11-16 00:39:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72705 states. [2019-11-16 00:39:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72705 states to 72705 states and 103425 transitions. [2019-11-16 00:39:32,944 INFO L711 BuchiCegarLoop]: Abstraction has 72705 states and 103425 transitions. [2019-11-16 00:39:32,944 INFO L591 BuchiCegarLoop]: Abstraction has 72705 states and 103425 transitions. [2019-11-16 00:39:32,944 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-16 00:39:32,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72705 states and 103425 transitions. [2019-11-16 00:39:33,117 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2019-11-16 00:39:33,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:33,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:33,119 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:33,119 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:33,119 INFO L791 eck$LassoCheckResult]: Stem: 222242#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 222243#L195-1 [2019-11-16 00:39:33,119 INFO L793 eck$LassoCheckResult]: Loop: 222243#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 222479#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 222476#L81 assume !(0 != main_~p1~0); 222477#L81-2 assume !(0 != main_~p2~0); 222455#L85-1 assume !(0 != main_~p3~0); 222456#L89-1 assume !(0 != main_~p4~0); 222439#L93-1 assume !(0 != main_~p5~0); 222441#L97-1 assume !(0 != main_~p6~0); 222415#L101-1 assume !(0 != main_~p7~0); 222417#L105-1 assume !(0 != main_~p8~0); 222391#L109-1 assume !(0 != main_~p9~0); 222393#L113-1 assume !(0 != main_~p10~0); 222371#L117-1 assume !(0 != main_~p11~0); 222372#L121-1 assume !(0 != main_~p12~0); 222347#L125-1 assume !(0 != main_~p13~0); 222349#L129-1 assume !(0 != main_~p1~0); 222518#L135-1 assume !(0 != main_~p2~0); 222517#L140-1 assume !(0 != main_~p3~0); 222514#L145-1 assume !(0 != main_~p4~0); 222512#L150-1 assume !(0 != main_~p5~0); 222510#L155-1 assume !(0 != main_~p6~0); 222507#L160-1 assume !(0 != main_~p7~0); 222503#L165-1 assume !(0 != main_~p8~0); 222499#L170-1 assume !(0 != main_~p9~0); 222495#L175-1 assume !(0 != main_~p10~0); 222492#L180-1 assume !(0 != main_~p11~0); 222487#L185-1 assume !(0 != main_~p12~0); 222483#L190-1 assume !(0 != main_~p13~0); 222243#L195-1 [2019-11-16 00:39:33,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:33,120 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 12 times [2019-11-16 00:39:33,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:33,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273891965] [2019-11-16 00:39:33,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:33,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:33,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:33,126 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:33,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1143243145, now seen corresponding path program 1 times [2019-11-16 00:39:33,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:33,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931907015] [2019-11-16 00:39:33,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:33,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:33,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:33,138 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:33,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1131927018, now seen corresponding path program 1 times [2019-11-16 00:39:33,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:33,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000222298] [2019-11-16 00:39:33,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:33,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:33,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:33,151 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:33,662 WARN L191 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-16 00:39:33,773 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-16 00:39:33,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:39:33 BoogieIcfgContainer [2019-11-16 00:39:33,880 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:39:33,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:39:33,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:39:33,881 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:39:33,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:25" (3/4) ... [2019-11-16 00:39:33,884 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-16 00:39:33,940 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_eb49a56b-9b6d-4cf3-8703-4fbe580ef73d/bin/uautomizer/witness.graphml [2019-11-16 00:39:33,940 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:39:33,942 INFO L168 Benchmark]: Toolchain (without parser) took 8986.85 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 847.8 MB). Free memory was 941.1 MB in the beginning and 1.4 GB in the end (delta: -451.0 MB). Peak memory consumption was 396.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:33,942 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:39:33,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 941.1 MB in the beginning and 1.2 GB in the end (delta: -238.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:33,943 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:39:33,943 INFO L168 Benchmark]: Boogie Preprocessor took 54.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:39:33,944 INFO L168 Benchmark]: RCFGBuilder took 380.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:33,944 INFO L168 Benchmark]: BuchiAutomizer took 8028.71 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 660.6 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -246.3 MB). Peak memory consumption was 864.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:33,945 INFO L168 Benchmark]: Witness Printer took 59.40 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:33,947 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 941.1 MB in the beginning and 1.2 GB in the end (delta: -238.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 380.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8028.71 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 660.6 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -246.3 MB). Peak memory consumption was 864.9 MB. Max. memory is 11.5 GB. * Witness Printer took 59.40 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72705 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 2.0s Buchi closure took 0.0s. Biggest automaton had 72705 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1122 SDtfs, 589 SDslu, 698 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI11 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: 48]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b87e72f=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57f7d99b=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70dd43fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54f9b668=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f5a529=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30f6b981=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a61bd96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@740c9e2f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@625447fb=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38ddb09e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b8217a6=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8280ab3=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d5eaa34=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@706d8d2=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 48]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L46] int cond; Loop: [L48] COND TRUE 1 [L49] cond = __VERIFIER_nondet_int() [L50] COND FALSE !(cond == 0) [L53] lk1 = 0 [L55] lk2 = 0 [L57] lk3 = 0 [L59] lk4 = 0 [L61] lk5 = 0 [L63] lk6 = 0 [L65] lk7 = 0 [L67] lk8 = 0 [L69] lk9 = 0 [L71] lk10 = 0 [L73] lk11 = 0 [L75] lk12 = 0 [L77] lk13 = 0 [L81] COND FALSE !(p1 != 0) [L85] COND FALSE !(p2 != 0) [L89] COND FALSE !(p3 != 0) [L93] COND FALSE !(p4 != 0) [L97] COND FALSE !(p5 != 0) [L101] COND FALSE !(p6 != 0) [L105] COND FALSE !(p7 != 0) [L109] COND FALSE !(p8 != 0) [L113] COND FALSE !(p9 != 0) [L117] COND FALSE !(p10 != 0) [L121] COND FALSE !(p11 != 0) [L125] COND FALSE !(p12 != 0) [L129] COND FALSE !(p13 != 0) [L135] COND FALSE !(p1 != 0) [L140] COND FALSE !(p2 != 0) [L145] COND FALSE !(p3 != 0) [L150] COND FALSE !(p4 != 0) [L155] COND FALSE !(p5 != 0) [L160] COND FALSE !(p6 != 0) [L165] COND FALSE !(p7 != 0) [L170] COND FALSE !(p8 != 0) [L175] COND FALSE !(p9 != 0) [L180] COND FALSE !(p10 != 0) [L185] COND FALSE !(p11 != 0) [L190] COND FALSE !(p12 != 0) [L195] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...