./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15-1.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_647df2a0-8fb8-4905-b23c-d46253bbb426/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/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 4892275a211cad54ffe3d940980c258aec58e47d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-15 21:30:34,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:30:34,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:30:34,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:30:34,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:30:34,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:30:34,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:30:34,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:30:34,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:30:34,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:30:34,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:30:34,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:30:34,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:30:34,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:30:34,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:30:34,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:30:34,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:30:34,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:30:34,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:30:34,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:30:34,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:30:34,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:30:34,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:30:34,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:30:34,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:30:34,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:30:34,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:30:34,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:30:34,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:30:34,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:30:34,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:30:34,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:30:34,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:30:34,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:30:34,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:30:34,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:30:34,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:30:34,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:30:34,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:30:34,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:30:34,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:30:34,917 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 21:30:34,949 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:30:34,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:30:34,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:30:34,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:30:34,952 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:30:34,952 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:30:34,952 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:30:34,952 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:30:34,953 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:30:34,953 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:30:34,953 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:30:34,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:30:34,954 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:30:34,954 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:30:34,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:30:34,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:30:34,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:30:34,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:30:34,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:30:34,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:30:34,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:30:34,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:30:34,957 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:30:34,957 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:30:34,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:30:34,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:30:34,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:30:34,958 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:30:34,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:30:34,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:30:34,959 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:30:34,960 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:30:34,960 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_647df2a0-8fb8-4905-b23c-d46253bbb426/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 -> 4892275a211cad54ffe3d940980c258aec58e47d [2019-11-15 21:30:34,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:30:34,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:30:35,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:30:35,003 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:30:35,003 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:30:35,004 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_15-1.c [2019-11-15 21:30:35,063 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/bin/uautomizer/data/56874edcd/d636eb9339f74796aa3d53913de572c8/FLAGd584a7098 [2019-11-15 21:30:35,512 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:30:35,513 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/sv-benchmarks/c/locks/test_locks_15-1.c [2019-11-15 21:30:35,526 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/bin/uautomizer/data/56874edcd/d636eb9339f74796aa3d53913de572c8/FLAGd584a7098 [2019-11-15 21:30:35,926 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/bin/uautomizer/data/56874edcd/d636eb9339f74796aa3d53913de572c8 [2019-11-15 21:30:35,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:30:35,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:30:35,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:30:35,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:30:35,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:30:35,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:30:35" (1/1) ... [2019-11-15 21:30:35,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c06bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:35, skipping insertion in model container [2019-11-15 21:30:35,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:30:35" (1/1) ... [2019-11-15 21:30:35,950 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:30:35,991 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:30:36,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:30:36,332 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:30:36,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:30:36,381 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:30:36,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36 WrapperNode [2019-11-15 21:30:36,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:30:36,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:30:36,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:30:36,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:30:36,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36" (1/1) ... [2019-11-15 21:30:36,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36" (1/1) ... [2019-11-15 21:30:36,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:30:36,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:30:36,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:30:36,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:30:36,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36" (1/1) ... [2019-11-15 21:30:36,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36" (1/1) ... [2019-11-15 21:30:36,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36" (1/1) ... [2019-11-15 21:30:36,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36" (1/1) ... [2019-11-15 21:30:36,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36" (1/1) ... [2019-11-15 21:30:36,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36" (1/1) ... [2019-11-15 21:30:36,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36" (1/1) ... [2019-11-15 21:30:36,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:30:36,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:30:36,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:30:36,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:30:36,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/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-15 21:30:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:30:36,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:30:36,936 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:30:36,936 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:30:36,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:30:36 BoogieIcfgContainer [2019-11-15 21:30:36,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:30:36,938 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:30:36,938 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:30:36,942 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:30:36,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:30:36,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:30:35" (1/3) ... [2019-11-15 21:30:36,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72735bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:30:36, skipping insertion in model container [2019-11-15 21:30:36,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:30:36,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:30:36" (2/3) ... [2019-11-15 21:30:36,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72735bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:30:36, skipping insertion in model container [2019-11-15 21:30:36,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:30:36,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:30:36" (3/3) ... [2019-11-15 21:30:36,947 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2019-11-15 21:30:37,026 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:30:37,027 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:30:37,027 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:30:37,027 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:30:37,027 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:30:37,028 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:30:37,028 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:30:37,028 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:30:37,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2019-11-15 21:30:37,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-15 21:30:37,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:37,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:37,079 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:37,080 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:37,080 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:30:37,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2019-11-15 21:30:37,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-15 21:30:37,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:37,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:37,086 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:37,087 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:37,093 INFO L791 eck$LassoCheckResult]: Stem: 28#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 9#L223-1true [2019-11-15 21:30:37,095 INFO L793 eck$LassoCheckResult]: Loop: 9#L223-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 41#L56true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4#L91true assume 0 != main_~p1~0;main_~lk1~0 := 1; 17#L91-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 10#L95-1true assume !(0 != main_~p3~0); 30#L99-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 21#L103-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 38#L107-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 43#L111-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 35#L115-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 52#L119-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 44#L123-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 49#L127-1true assume !(0 != main_~p11~0); 14#L131-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 6#L135-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 27#L139-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 32#L143-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 23#L147-1true assume !(0 != main_~p1~0); 15#L153-1true assume 0 != main_~p2~0; 50#L159true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 24#L158true assume !(0 != main_~p3~0); 54#L163-1true assume !(0 != main_~p4~0); 7#L168-1true assume !(0 != main_~p5~0); 40#L173-1true assume !(0 != main_~p6~0); 47#L178-1true assume !(0 != main_~p7~0); 29#L183-1true assume !(0 != main_~p8~0); 33#L188-1true assume !(0 != main_~p9~0); 11#L193-1true assume !(0 != main_~p10~0); 20#L198-1true assume !(0 != main_~p11~0); 51#L203-1true assume !(0 != main_~p12~0); 3#L208-1true assume !(0 != main_~p13~0); 26#L213-1true assume 0 != main_~p14~0; 5#L219true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 45#L218true assume !(0 != main_~p15~0); 9#L223-1true [2019-11-15 21:30:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:37,101 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 21:30:37,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:37,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453777850] [2019-11-15 21:30:37,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:37,240 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:37,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:37,241 INFO L82 PathProgramCache]: Analyzing trace with hash 878446630, now seen corresponding path program 1 times [2019-11-15 21:30:37,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:37,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662274857] [2019-11-15 21:30:37,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:37,368 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-15 21:30:37,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662274857] [2019-11-15 21:30:37,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:37,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:37,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128849828] [2019-11-15 21:30:37,379 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:37,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:37,396 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-11-15 21:30:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:37,446 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2019-11-15 21:30:37,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:37,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 189 transitions. [2019-11-15 21:30:37,455 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2019-11-15 21:30:37,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 94 states and 148 transitions. [2019-11-15 21:30:37,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-11-15 21:30:37,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2019-11-15 21:30:37,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 148 transitions. [2019-11-15 21:30:37,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:37,467 INFO L688 BuchiCegarLoop]: Abstraction has 94 states and 148 transitions. [2019-11-15 21:30:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 148 transitions. [2019-11-15 21:30:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-11-15 21:30:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 21:30:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 148 transitions. [2019-11-15 21:30:37,509 INFO L711 BuchiCegarLoop]: Abstraction has 94 states and 148 transitions. [2019-11-15 21:30:37,509 INFO L591 BuchiCegarLoop]: Abstraction has 94 states and 148 transitions. [2019-11-15 21:30:37,510 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:30:37,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 148 transitions. [2019-11-15 21:30:37,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2019-11-15 21:30:37,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:37,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:37,515 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:37,515 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:37,516 INFO L791 eck$LassoCheckResult]: Stem: 219#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 220#L223-1 [2019-11-15 21:30:37,516 INFO L793 eck$LassoCheckResult]: Loop: 220#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 200#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 201#L91 assume !(0 != main_~p1~0); 204#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 189#L95-1 assume !(0 != main_~p3~0); 190#L99-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 240#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 237#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 234#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 232#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 230#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 229#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 228#L127-1 assume !(0 != main_~p11~0); 226#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 176#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 177#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 218#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 223#L147-1 assume !(0 != main_~p1~0); 224#L153-1 assume 0 != main_~p2~0; 259#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 258#L158 assume !(0 != main_~p3~0); 256#L163-1 assume !(0 != main_~p4~0); 254#L168-1 assume !(0 != main_~p5~0); 252#L173-1 assume !(0 != main_~p6~0); 250#L178-1 assume !(0 != main_~p7~0); 247#L183-1 assume !(0 != main_~p8~0); 246#L188-1 assume !(0 != main_~p9~0); 244#L193-1 assume !(0 != main_~p10~0); 211#L198-1 assume !(0 != main_~p11~0); 195#L203-1 assume !(0 != main_~p12~0); 166#L208-1 assume !(0 != main_~p13~0); 168#L213-1 assume 0 != main_~p14~0; 172#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 173#L218 assume !(0 != main_~p15~0); 220#L223-1 [2019-11-15 21:30:37,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:37,517 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-15 21:30:37,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:37,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739433158] [2019-11-15 21:30:37,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:37,535 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:37,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1153206244, now seen corresponding path program 1 times [2019-11-15 21:30:37,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:37,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811232294] [2019-11-15 21:30:37,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:37,618 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-15 21:30:37,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811232294] [2019-11-15 21:30:37,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:37,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:37,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41720919] [2019-11-15 21:30:37,619 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:37,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:37,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:37,621 INFO L87 Difference]: Start difference. First operand 94 states and 148 transitions. cyclomatic complexity: 56 Second operand 3 states. [2019-11-15 21:30:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:37,676 INFO L93 Difference]: Finished difference Result 185 states and 289 transitions. [2019-11-15 21:30:37,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:37,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 289 transitions. [2019-11-15 21:30:37,684 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2019-11-15 21:30:37,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 185 states and 289 transitions. [2019-11-15 21:30:37,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 185 [2019-11-15 21:30:37,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2019-11-15 21:30:37,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 289 transitions. [2019-11-15 21:30:37,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:37,691 INFO L688 BuchiCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-11-15 21:30:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 289 transitions. [2019-11-15 21:30:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-11-15 21:30:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-15 21:30:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2019-11-15 21:30:37,711 INFO L711 BuchiCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-11-15 21:30:37,711 INFO L591 BuchiCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-11-15 21:30:37,711 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:30:37,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 289 transitions. [2019-11-15 21:30:37,715 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2019-11-15 21:30:37,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:37,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:37,717 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:37,717 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:37,717 INFO L791 eck$LassoCheckResult]: Stem: 503#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 504#L223-1 [2019-11-15 21:30:37,718 INFO L793 eck$LassoCheckResult]: Loop: 504#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 584#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 583#L91 assume !(0 != main_~p1~0); 487#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 474#L95-1 assume !(0 != main_~p3~0); 475#L99-1 assume !(0 != main_~p4~0); 581#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 621#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 620#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 619#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 618#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 617#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 616#L127-1 assume !(0 != main_~p11~0); 615#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 614#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 613#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 612#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 610#L147-1 assume !(0 != main_~p1~0); 609#L153-1 assume 0 != main_~p2~0; 608#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 607#L158 assume !(0 != main_~p3~0); 605#L163-1 assume !(0 != main_~p4~0); 604#L168-1 assume !(0 != main_~p5~0); 602#L173-1 assume !(0 != main_~p6~0); 600#L178-1 assume !(0 != main_~p7~0); 505#L183-1 assume !(0 != main_~p8~0); 456#L188-1 assume !(0 != main_~p9~0); 458#L193-1 assume !(0 != main_~p10~0); 593#L198-1 assume !(0 != main_~p11~0); 592#L203-1 assume !(0 != main_~p12~0); 590#L208-1 assume !(0 != main_~p13~0); 588#L213-1 assume 0 != main_~p14~0; 587#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 586#L218 assume !(0 != main_~p15~0); 504#L223-1 [2019-11-15 21:30:37,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:37,718 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-15 21:30:37,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:37,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587171178] [2019-11-15 21:30:37,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:37,734 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:37,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:37,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1755557658, now seen corresponding path program 1 times [2019-11-15 21:30:37,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:37,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131554333] [2019-11-15 21:30:37,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:37,828 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-15 21:30:37,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131554333] [2019-11-15 21:30:37,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:37,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:37,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569128474] [2019-11-15 21:30:37,830 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:37,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:37,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:37,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:37,831 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. cyclomatic complexity: 108 Second operand 3 states. [2019-11-15 21:30:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:37,867 INFO L93 Difference]: Finished difference Result 365 states and 565 transitions. [2019-11-15 21:30:37,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:37,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 365 states and 565 transitions. [2019-11-15 21:30:37,883 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2019-11-15 21:30:37,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 365 states to 365 states and 565 transitions. [2019-11-15 21:30:37,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2019-11-15 21:30:37,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 365 [2019-11-15 21:30:37,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 565 transitions. [2019-11-15 21:30:37,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:37,893 INFO L688 BuchiCegarLoop]: Abstraction has 365 states and 565 transitions. [2019-11-15 21:30:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 565 transitions. [2019-11-15 21:30:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2019-11-15 21:30:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-15 21:30:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 565 transitions. [2019-11-15 21:30:37,918 INFO L711 BuchiCegarLoop]: Abstraction has 365 states and 565 transitions. [2019-11-15 21:30:37,918 INFO L591 BuchiCegarLoop]: Abstraction has 365 states and 565 transitions. [2019-11-15 21:30:37,918 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:30:37,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 565 transitions. [2019-11-15 21:30:37,921 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2019-11-15 21:30:37,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:37,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:37,923 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:37,923 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:37,923 INFO L791 eck$LassoCheckResult]: Stem: 1062#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 1063#L223-1 [2019-11-15 21:30:37,923 INFO L793 eck$LassoCheckResult]: Loop: 1063#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1217#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1215#L91 assume !(0 != main_~p1~0); 1213#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1211#L95-1 assume !(0 != main_~p3~0); 1209#L99-1 assume !(0 != main_~p4~0); 1202#L103-1 assume !(0 != main_~p5~0); 1204#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1194#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1195#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1189#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1190#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1184#L127-1 assume !(0 != main_~p11~0); 1185#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1178#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1179#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1172#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1173#L147-1 assume !(0 != main_~p1~0); 1167#L153-1 assume 0 != main_~p2~0; 1168#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1144#L158 assume !(0 != main_~p3~0); 1143#L163-1 assume !(0 != main_~p4~0); 1252#L168-1 assume !(0 != main_~p5~0); 1250#L173-1 assume !(0 != main_~p6~0); 1246#L178-1 assume !(0 != main_~p7~0); 1243#L183-1 assume !(0 != main_~p8~0); 1242#L188-1 assume !(0 != main_~p9~0); 1240#L193-1 assume !(0 != main_~p10~0); 1236#L198-1 assume !(0 != main_~p11~0); 1234#L203-1 assume !(0 != main_~p12~0); 1231#L208-1 assume !(0 != main_~p13~0); 1228#L213-1 assume 0 != main_~p14~0; 1227#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 1222#L218 assume !(0 != main_~p15~0); 1063#L223-1 [2019-11-15 21:30:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:37,924 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-15 21:30:37,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:37,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703514410] [2019-11-15 21:30:37,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:37,936 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2029936548, now seen corresponding path program 1 times [2019-11-15 21:30:37,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:37,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799283570] [2019-11-15 21:30:37,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:37,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:37,970 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-15 21:30:37,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799283570] [2019-11-15 21:30:37,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:37,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:37,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009780929] [2019-11-15 21:30:37,971 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:37,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:37,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:37,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:37,972 INFO L87 Difference]: Start difference. First operand 365 states and 565 transitions. cyclomatic complexity: 208 Second operand 3 states. [2019-11-15 21:30:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:38,003 INFO L93 Difference]: Finished difference Result 721 states and 1105 transitions. [2019-11-15 21:30:38,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:38,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 1105 transitions. [2019-11-15 21:30:38,015 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2019-11-15 21:30:38,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 721 states and 1105 transitions. [2019-11-15 21:30:38,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 721 [2019-11-15 21:30:38,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 721 [2019-11-15 21:30:38,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 721 states and 1105 transitions. [2019-11-15 21:30:38,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:38,031 INFO L688 BuchiCegarLoop]: Abstraction has 721 states and 1105 transitions. [2019-11-15 21:30:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states and 1105 transitions. [2019-11-15 21:30:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2019-11-15 21:30:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-11-15 21:30:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1105 transitions. [2019-11-15 21:30:38,067 INFO L711 BuchiCegarLoop]: Abstraction has 721 states and 1105 transitions. [2019-11-15 21:30:38,068 INFO L591 BuchiCegarLoop]: Abstraction has 721 states and 1105 transitions. [2019-11-15 21:30:38,068 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:30:38,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 721 states and 1105 transitions. [2019-11-15 21:30:38,074 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2019-11-15 21:30:38,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:38,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:38,076 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:38,076 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:38,076 INFO L791 eck$LassoCheckResult]: Stem: 2156#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 2157#L223-1 [2019-11-15 21:30:38,077 INFO L793 eck$LassoCheckResult]: Loop: 2157#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2233#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 2231#L91 assume !(0 != main_~p1~0); 2229#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2227#L95-1 assume !(0 != main_~p3~0); 2223#L99-1 assume !(0 != main_~p4~0); 2219#L103-1 assume !(0 != main_~p5~0); 2215#L107-1 assume !(0 != main_~p6~0); 2213#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2211#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2209#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2207#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2205#L127-1 assume !(0 != main_~p11~0); 2203#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2201#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2199#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2197#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2195#L147-1 assume !(0 != main_~p1~0); 2189#L153-1 assume 0 != main_~p2~0; 2190#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2181#L158 assume !(0 != main_~p3~0); 2180#L163-1 assume !(0 != main_~p4~0); 2276#L168-1 assume !(0 != main_~p5~0); 2272#L173-1 assume !(0 != main_~p6~0); 2269#L178-1 assume !(0 != main_~p7~0); 2264#L183-1 assume !(0 != main_~p8~0); 2261#L188-1 assume !(0 != main_~p9~0); 2257#L193-1 assume !(0 != main_~p10~0); 2252#L198-1 assume !(0 != main_~p11~0); 2249#L203-1 assume !(0 != main_~p12~0); 2245#L208-1 assume !(0 != main_~p13~0); 2242#L213-1 assume 0 != main_~p14~0; 2240#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 2237#L218 assume !(0 != main_~p15~0); 2157#L223-1 [2019-11-15 21:30:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:38,077 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-15 21:30:38,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:38,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176195494] [2019-11-15 21:30:38,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:38,089 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:38,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:38,090 INFO L82 PathProgramCache]: Analyzing trace with hash -341802714, now seen corresponding path program 1 times [2019-11-15 21:30:38,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:38,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012740297] [2019-11-15 21:30:38,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:38,128 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-15 21:30:38,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012740297] [2019-11-15 21:30:38,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:38,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:38,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714617049] [2019-11-15 21:30:38,130 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:38,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:38,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:38,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:38,131 INFO L87 Difference]: Start difference. First operand 721 states and 1105 transitions. cyclomatic complexity: 400 Second operand 3 states. [2019-11-15 21:30:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:38,168 INFO L93 Difference]: Finished difference Result 1425 states and 2161 transitions. [2019-11-15 21:30:38,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:38,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1425 states and 2161 transitions. [2019-11-15 21:30:38,190 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2019-11-15 21:30:38,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1425 states to 1425 states and 2161 transitions. [2019-11-15 21:30:38,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1425 [2019-11-15 21:30:38,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1425 [2019-11-15 21:30:38,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1425 states and 2161 transitions. [2019-11-15 21:30:38,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:38,212 INFO L688 BuchiCegarLoop]: Abstraction has 1425 states and 2161 transitions. [2019-11-15 21:30:38,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states and 2161 transitions. [2019-11-15 21:30:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2019-11-15 21:30:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2019-11-15 21:30:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2161 transitions. [2019-11-15 21:30:38,250 INFO L711 BuchiCegarLoop]: Abstraction has 1425 states and 2161 transitions. [2019-11-15 21:30:38,250 INFO L591 BuchiCegarLoop]: Abstraction has 1425 states and 2161 transitions. [2019-11-15 21:30:38,250 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:30:38,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1425 states and 2161 transitions. [2019-11-15 21:30:38,261 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2019-11-15 21:30:38,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:38,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:38,262 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:38,262 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:38,262 INFO L791 eck$LassoCheckResult]: Stem: 4308#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 4309#L223-1 [2019-11-15 21:30:38,263 INFO L793 eck$LassoCheckResult]: Loop: 4309#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4386#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4384#L91 assume !(0 != main_~p1~0); 4382#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4380#L95-1 assume !(0 != main_~p3~0); 4376#L99-1 assume !(0 != main_~p4~0); 4372#L103-1 assume !(0 != main_~p5~0); 4368#L107-1 assume !(0 != main_~p6~0); 4364#L111-1 assume !(0 != main_~p7~0); 4362#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4360#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4358#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4356#L127-1 assume !(0 != main_~p11~0); 4354#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4352#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4350#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4348#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4346#L147-1 assume !(0 != main_~p1~0); 4340#L153-1 assume 0 != main_~p2~0; 4341#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4334#L158 assume !(0 != main_~p3~0); 4333#L163-1 assume !(0 != main_~p4~0); 4429#L168-1 assume !(0 != main_~p5~0); 4425#L173-1 assume !(0 != main_~p6~0); 4421#L178-1 assume !(0 != main_~p7~0); 4417#L183-1 assume !(0 != main_~p8~0); 4414#L188-1 assume !(0 != main_~p9~0); 4410#L193-1 assume !(0 != main_~p10~0); 4405#L198-1 assume !(0 != main_~p11~0); 4402#L203-1 assume !(0 != main_~p12~0); 4398#L208-1 assume !(0 != main_~p13~0); 4395#L213-1 assume 0 != main_~p14~0; 4393#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 4390#L218 assume !(0 != main_~p15~0); 4309#L223-1 [2019-11-15 21:30:38,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:38,263 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-15 21:30:38,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:38,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731739884] [2019-11-15 21:30:38,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:38,276 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash -279763100, now seen corresponding path program 1 times [2019-11-15 21:30:38,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:38,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445258724] [2019-11-15 21:30:38,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:38,307 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-15 21:30:38,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445258724] [2019-11-15 21:30:38,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:38,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:38,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537304004] [2019-11-15 21:30:38,309 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:38,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:38,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:38,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:38,310 INFO L87 Difference]: Start difference. First operand 1425 states and 2161 transitions. cyclomatic complexity: 768 Second operand 3 states. [2019-11-15 21:30:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:38,357 INFO L93 Difference]: Finished difference Result 2817 states and 4225 transitions. [2019-11-15 21:30:38,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:38,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2817 states and 4225 transitions. [2019-11-15 21:30:38,395 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2019-11-15 21:30:38,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2817 states to 2817 states and 4225 transitions. [2019-11-15 21:30:38,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2817 [2019-11-15 21:30:38,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2817 [2019-11-15 21:30:38,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2817 states and 4225 transitions. [2019-11-15 21:30:38,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:38,434 INFO L688 BuchiCegarLoop]: Abstraction has 2817 states and 4225 transitions. [2019-11-15 21:30:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states and 4225 transitions. [2019-11-15 21:30:38,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2817. [2019-11-15 21:30:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-11-15 21:30:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4225 transitions. [2019-11-15 21:30:38,506 INFO L711 BuchiCegarLoop]: Abstraction has 2817 states and 4225 transitions. [2019-11-15 21:30:38,506 INFO L591 BuchiCegarLoop]: Abstraction has 2817 states and 4225 transitions. [2019-11-15 21:30:38,506 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:30:38,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2817 states and 4225 transitions. [2019-11-15 21:30:38,529 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2019-11-15 21:30:38,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:38,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:38,533 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:38,533 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:38,534 INFO L791 eck$LassoCheckResult]: Stem: 8559#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 8560#L223-1 [2019-11-15 21:30:38,535 INFO L793 eck$LassoCheckResult]: Loop: 8560#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 8673#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 8669#L91 assume !(0 != main_~p1~0); 8665#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8661#L95-1 assume !(0 != main_~p3~0); 8654#L99-1 assume !(0 != main_~p4~0); 8646#L103-1 assume !(0 != main_~p5~0); 8638#L107-1 assume !(0 != main_~p6~0); 8630#L111-1 assume !(0 != main_~p7~0); 8624#L115-1 assume !(0 != main_~p8~0); 8619#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8620#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8613#L127-1 assume !(0 != main_~p11~0); 8614#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8607#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8608#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8601#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8602#L147-1 assume !(0 != main_~p1~0); 8593#L153-1 assume 0 != main_~p2~0; 8594#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8759#L158 assume !(0 != main_~p3~0); 8752#L163-1 assume !(0 != main_~p4~0); 8746#L168-1 assume !(0 != main_~p5~0); 8722#L173-1 assume !(0 != main_~p6~0); 8719#L178-1 assume !(0 != main_~p7~0); 8716#L183-1 assume !(0 != main_~p8~0); 8715#L188-1 assume !(0 != main_~p9~0); 8713#L193-1 assume !(0 != main_~p10~0); 8710#L198-1 assume !(0 != main_~p11~0); 8709#L203-1 assume !(0 != main_~p12~0); 8707#L208-1 assume !(0 != main_~p13~0); 8704#L213-1 assume 0 != main_~p14~0; 8701#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 8682#L218 assume !(0 != main_~p15~0); 8560#L223-1 [2019-11-15 21:30:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:38,536 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-15 21:30:38,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:38,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118100566] [2019-11-15 21:30:38,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:38,564 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:38,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:38,565 INFO L82 PathProgramCache]: Analyzing trace with hash -139214490, now seen corresponding path program 1 times [2019-11-15 21:30:38,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:38,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228534511] [2019-11-15 21:30:38,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:38,591 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-15 21:30:38,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228534511] [2019-11-15 21:30:38,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:38,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:38,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189001832] [2019-11-15 21:30:38,593 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:38,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:38,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:38,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:38,594 INFO L87 Difference]: Start difference. First operand 2817 states and 4225 transitions. cyclomatic complexity: 1472 Second operand 3 states. [2019-11-15 21:30:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:38,669 INFO L93 Difference]: Finished difference Result 5569 states and 8257 transitions. [2019-11-15 21:30:38,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:38,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5569 states and 8257 transitions. [2019-11-15 21:30:38,723 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2019-11-15 21:30:38,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5569 states to 5569 states and 8257 transitions. [2019-11-15 21:30:38,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5569 [2019-11-15 21:30:38,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5569 [2019-11-15 21:30:38,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5569 states and 8257 transitions. [2019-11-15 21:30:38,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:38,795 INFO L688 BuchiCegarLoop]: Abstraction has 5569 states and 8257 transitions. [2019-11-15 21:30:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5569 states and 8257 transitions. [2019-11-15 21:30:38,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5569 to 5569. [2019-11-15 21:30:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5569 states. [2019-11-15 21:30:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 8257 transitions. [2019-11-15 21:30:38,953 INFO L711 BuchiCegarLoop]: Abstraction has 5569 states and 8257 transitions. [2019-11-15 21:30:38,953 INFO L591 BuchiCegarLoop]: Abstraction has 5569 states and 8257 transitions. [2019-11-15 21:30:38,953 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:30:38,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5569 states and 8257 transitions. [2019-11-15 21:30:38,986 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2019-11-15 21:30:38,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:38,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:38,987 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:38,987 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:38,988 INFO L791 eck$LassoCheckResult]: Stem: 16945#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 16946#L223-1 [2019-11-15 21:30:38,988 INFO L793 eck$LassoCheckResult]: Loop: 16946#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 17472#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 17468#L91 assume !(0 != main_~p1~0); 17465#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 17461#L95-1 assume !(0 != main_~p3~0); 17457#L99-1 assume !(0 != main_~p4~0); 17449#L103-1 assume !(0 != main_~p5~0); 17441#L107-1 assume !(0 != main_~p6~0); 17433#L111-1 assume !(0 != main_~p7~0); 17425#L115-1 assume !(0 != main_~p8~0); 17421#L119-1 assume !(0 != main_~p9~0); 17417#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 17413#L127-1 assume !(0 != main_~p11~0); 17409#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 17405#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 17401#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 17397#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 17390#L147-1 assume !(0 != main_~p1~0); 17386#L153-1 assume 0 != main_~p2~0; 17383#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 17377#L158 assume !(0 != main_~p3~0); 17369#L163-1 assume !(0 != main_~p4~0); 17370#L168-1 assume !(0 != main_~p5~0); 17503#L173-1 assume !(0 != main_~p6~0); 17501#L178-1 assume !(0 != main_~p7~0); 17496#L183-1 assume !(0 != main_~p8~0); 17492#L188-1 assume !(0 != main_~p9~0); 17490#L193-1 assume !(0 != main_~p10~0); 17487#L198-1 assume !(0 != main_~p11~0); 17486#L203-1 assume !(0 != main_~p12~0); 17483#L208-1 assume !(0 != main_~p13~0); 17481#L213-1 assume 0 != main_~p14~0; 17480#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 17476#L218 assume !(0 != main_~p15~0); 16946#L223-1 [2019-11-15 21:30:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:38,988 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-15 21:30:38,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:38,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332651433] [2019-11-15 21:30:38,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:38,998 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:38,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:38,999 INFO L82 PathProgramCache]: Analyzing trace with hash -273227996, now seen corresponding path program 1 times [2019-11-15 21:30:38,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:39,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161247009] [2019-11-15 21:30:39,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:39,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:39,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:39,024 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-15 21:30:39,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161247009] [2019-11-15 21:30:39,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:39,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:39,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137738340] [2019-11-15 21:30:39,026 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:39,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:39,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:39,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:39,027 INFO L87 Difference]: Start difference. First operand 5569 states and 8257 transitions. cyclomatic complexity: 2816 Second operand 3 states. [2019-11-15 21:30:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:39,114 INFO L93 Difference]: Finished difference Result 11009 states and 16129 transitions. [2019-11-15 21:30:39,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:39,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11009 states and 16129 transitions. [2019-11-15 21:30:39,186 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2019-11-15 21:30:39,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11009 states to 11009 states and 16129 transitions. [2019-11-15 21:30:39,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11009 [2019-11-15 21:30:39,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11009 [2019-11-15 21:30:39,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11009 states and 16129 transitions. [2019-11-15 21:30:39,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:39,301 INFO L688 BuchiCegarLoop]: Abstraction has 11009 states and 16129 transitions. [2019-11-15 21:30:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states and 16129 transitions. [2019-11-15 21:30:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 11009. [2019-11-15 21:30:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11009 states. [2019-11-15 21:30:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11009 states to 11009 states and 16129 transitions. [2019-11-15 21:30:39,547 INFO L711 BuchiCegarLoop]: Abstraction has 11009 states and 16129 transitions. [2019-11-15 21:30:39,547 INFO L591 BuchiCegarLoop]: Abstraction has 11009 states and 16129 transitions. [2019-11-15 21:30:39,548 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 21:30:39,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11009 states and 16129 transitions. [2019-11-15 21:30:39,589 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2019-11-15 21:30:39,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:39,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:39,590 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:39,590 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:39,590 INFO L791 eck$LassoCheckResult]: Stem: 33534#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 33535#L223-1 [2019-11-15 21:30:39,591 INFO L793 eck$LassoCheckResult]: Loop: 33535#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 33828#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 33824#L91 assume !(0 != main_~p1~0); 33822#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 33820#L95-1 assume !(0 != main_~p3~0); 33816#L99-1 assume !(0 != main_~p4~0); 33813#L103-1 assume !(0 != main_~p5~0); 33814#L107-1 assume !(0 != main_~p6~0); 33748#L111-1 assume !(0 != main_~p7~0); 33750#L115-1 assume !(0 != main_~p8~0); 33884#L119-1 assume !(0 != main_~p9~0); 33722#L123-1 assume !(0 != main_~p10~0); 33724#L127-1 assume !(0 != main_~p11~0); 33707#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 33708#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 33697#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 33698#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 33685#L147-1 assume !(0 != main_~p1~0); 33686#L153-1 assume 0 != main_~p2~0; 33674#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 33675#L158 assume !(0 != main_~p3~0); 33649#L163-1 assume !(0 != main_~p4~0); 33650#L168-1 assume !(0 != main_~p5~0); 33863#L173-1 assume !(0 != main_~p6~0); 33859#L178-1 assume !(0 != main_~p7~0); 33856#L183-1 assume !(0 != main_~p8~0); 33854#L188-1 assume !(0 != main_~p9~0); 33851#L193-1 assume !(0 != main_~p10~0); 33847#L198-1 assume !(0 != main_~p11~0); 33844#L203-1 assume !(0 != main_~p12~0); 33840#L208-1 assume !(0 != main_~p13~0); 33837#L213-1 assume 0 != main_~p14~0; 33835#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 33832#L218 assume !(0 != main_~p15~0); 33535#L223-1 [2019-11-15 21:30:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:39,591 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-15 21:30:39,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:39,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502455629] [2019-11-15 21:30:39,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:39,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:39,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:39,599 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:39,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:39,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2078666330, now seen corresponding path program 1 times [2019-11-15 21:30:39,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:39,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849842818] [2019-11-15 21:30:39,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:39,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:39,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:39,626 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-15 21:30:39,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849842818] [2019-11-15 21:30:39,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:39,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:39,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098354072] [2019-11-15 21:30:39,627 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:39,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:39,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:39,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:39,628 INFO L87 Difference]: Start difference. First operand 11009 states and 16129 transitions. cyclomatic complexity: 5376 Second operand 3 states. [2019-11-15 21:30:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:39,700 INFO L93 Difference]: Finished difference Result 21761 states and 31489 transitions. [2019-11-15 21:30:39,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:39,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21761 states and 31489 transitions. [2019-11-15 21:30:39,806 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2019-11-15 21:30:39,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21761 states to 21761 states and 31489 transitions. [2019-11-15 21:30:39,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21761 [2019-11-15 21:30:39,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21761 [2019-11-15 21:30:39,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21761 states and 31489 transitions. [2019-11-15 21:30:39,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:39,946 INFO L688 BuchiCegarLoop]: Abstraction has 21761 states and 31489 transitions. [2019-11-15 21:30:39,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21761 states and 31489 transitions. [2019-11-15 21:30:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21761 to 21761. [2019-11-15 21:30:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21761 states. [2019-11-15 21:30:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21761 states to 21761 states and 31489 transitions. [2019-11-15 21:30:40,489 INFO L711 BuchiCegarLoop]: Abstraction has 21761 states and 31489 transitions. [2019-11-15 21:30:40,489 INFO L591 BuchiCegarLoop]: Abstraction has 21761 states and 31489 transitions. [2019-11-15 21:30:40,493 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 21:30:40,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21761 states and 31489 transitions. [2019-11-15 21:30:40,561 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2019-11-15 21:30:40,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:40,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:40,562 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:40,562 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:40,563 INFO L791 eck$LassoCheckResult]: Stem: 66306#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 66307#L223-1 [2019-11-15 21:30:40,563 INFO L793 eck$LassoCheckResult]: Loop: 66307#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 66558#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 66555#L91 assume !(0 != main_~p1~0); 66552#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 66550#L95-1 assume !(0 != main_~p3~0); 66547#L99-1 assume !(0 != main_~p4~0); 66544#L103-1 assume !(0 != main_~p5~0); 66534#L107-1 assume !(0 != main_~p6~0); 66536#L111-1 assume !(0 != main_~p7~0); 66518#L115-1 assume !(0 != main_~p8~0); 66520#L119-1 assume !(0 != main_~p9~0); 66504#L123-1 assume !(0 != main_~p10~0); 66506#L127-1 assume !(0 != main_~p11~0); 66484#L131-1 assume !(0 != main_~p12~0); 66486#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 66469#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 66470#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 66460#L147-1 assume !(0 != main_~p1~0); 66461#L153-1 assume 0 != main_~p2~0; 66451#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 66452#L158 assume !(0 != main_~p3~0); 66423#L163-1 assume !(0 != main_~p4~0); 66424#L168-1 assume !(0 != main_~p5~0); 66590#L173-1 assume !(0 != main_~p6~0); 66588#L178-1 assume !(0 != main_~p7~0); 66586#L183-1 assume !(0 != main_~p8~0); 66584#L188-1 assume !(0 != main_~p9~0); 66582#L193-1 assume !(0 != main_~p10~0); 66578#L198-1 assume !(0 != main_~p11~0); 66574#L203-1 assume !(0 != main_~p12~0); 66571#L208-1 assume !(0 != main_~p13~0); 66567#L213-1 assume 0 != main_~p14~0; 66565#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 66563#L218 assume !(0 != main_~p15~0); 66307#L223-1 [2019-11-15 21:30:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:40,564 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-15 21:30:40,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:40,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573870921] [2019-11-15 21:30:40,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:40,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:40,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:40,587 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:40,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1655964504, now seen corresponding path program 1 times [2019-11-15 21:30:40,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:40,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598212855] [2019-11-15 21:30:40,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:40,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:40,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:40,619 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-15 21:30:40,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598212855] [2019-11-15 21:30:40,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:40,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:40,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458094275] [2019-11-15 21:30:40,620 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:40,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:40,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:40,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:40,621 INFO L87 Difference]: Start difference. First operand 21761 states and 31489 transitions. cyclomatic complexity: 10240 Second operand 3 states. [2019-11-15 21:30:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:40,746 INFO L93 Difference]: Finished difference Result 43009 states and 61441 transitions. [2019-11-15 21:30:40,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:40,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43009 states and 61441 transitions. [2019-11-15 21:30:40,938 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2019-11-15 21:30:41,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43009 states to 43009 states and 61441 transitions. [2019-11-15 21:30:41,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43009 [2019-11-15 21:30:41,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43009 [2019-11-15 21:30:41,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43009 states and 61441 transitions. [2019-11-15 21:30:41,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:41,174 INFO L688 BuchiCegarLoop]: Abstraction has 43009 states and 61441 transitions. [2019-11-15 21:30:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43009 states and 61441 transitions. [2019-11-15 21:30:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43009 to 43009. [2019-11-15 21:30:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-11-15 21:30:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 61441 transitions. [2019-11-15 21:30:42,132 INFO L711 BuchiCegarLoop]: Abstraction has 43009 states and 61441 transitions. [2019-11-15 21:30:42,133 INFO L591 BuchiCegarLoop]: Abstraction has 43009 states and 61441 transitions. [2019-11-15 21:30:42,133 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 21:30:42,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43009 states and 61441 transitions. [2019-11-15 21:30:42,272 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2019-11-15 21:30:42,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:42,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:42,274 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:42,274 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:42,274 INFO L791 eck$LassoCheckResult]: Stem: 131090#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 131091#L223-1 [2019-11-15 21:30:42,275 INFO L793 eck$LassoCheckResult]: Loop: 131091#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 131712#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 131710#L91 assume !(0 != main_~p1~0); 131709#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 131708#L95-1 assume !(0 != main_~p3~0); 131706#L99-1 assume !(0 != main_~p4~0); 131704#L103-1 assume !(0 != main_~p5~0); 131702#L107-1 assume !(0 != main_~p6~0); 131700#L111-1 assume !(0 != main_~p7~0); 131697#L115-1 assume !(0 != main_~p8~0); 131693#L119-1 assume !(0 != main_~p9~0); 131690#L123-1 assume !(0 != main_~p10~0); 131675#L127-1 assume !(0 != main_~p11~0); 131676#L131-1 assume !(0 != main_~p12~0); 131660#L135-1 assume !(0 != main_~p13~0); 131662#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 131647#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 131648#L147-1 assume !(0 != main_~p1~0); 131635#L153-1 assume 0 != main_~p2~0; 131636#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 131622#L158 assume !(0 != main_~p3~0); 131621#L163-1 assume !(0 != main_~p4~0); 131604#L168-1 assume !(0 != main_~p5~0); 131606#L173-1 assume !(0 != main_~p6~0); 131593#L178-1 assume !(0 != main_~p7~0); 131594#L183-1 assume !(0 != main_~p8~0); 131576#L188-1 assume !(0 != main_~p9~0); 131578#L193-1 assume !(0 != main_~p10~0); 131721#L198-1 assume !(0 != main_~p11~0); 131719#L203-1 assume !(0 != main_~p12~0); 131717#L208-1 assume !(0 != main_~p13~0); 131716#L213-1 assume 0 != main_~p14~0; 131715#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 131714#L218 assume !(0 != main_~p15~0); 131091#L223-1 [2019-11-15 21:30:42,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:42,275 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2019-11-15 21:30:42,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:42,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177821697] [2019-11-15 21:30:42,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:42,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:42,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:42,295 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:42,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:42,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1821354342, now seen corresponding path program 1 times [2019-11-15 21:30:42,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:42,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788924350] [2019-11-15 21:30:42,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:42,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:42,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:42,337 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-15 21:30:42,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788924350] [2019-11-15 21:30:42,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:42,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:30:42,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110713391] [2019-11-15 21:30:42,339 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:42,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:42,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:42,339 INFO L87 Difference]: Start difference. First operand 43009 states and 61441 transitions. cyclomatic complexity: 19456 Second operand 3 states. [2019-11-15 21:30:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:42,570 INFO L93 Difference]: Finished difference Result 84993 states and 119809 transitions. [2019-11-15 21:30:42,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:42,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84993 states and 119809 transitions. [2019-11-15 21:30:43,347 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2019-11-15 21:30:43,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84993 states to 84993 states and 119809 transitions. [2019-11-15 21:30:43,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84993 [2019-11-15 21:30:43,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84993 [2019-11-15 21:30:43,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84993 states and 119809 transitions. [2019-11-15 21:30:43,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:43,705 INFO L688 BuchiCegarLoop]: Abstraction has 84993 states and 119809 transitions. [2019-11-15 21:30:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84993 states and 119809 transitions. [2019-11-15 21:30:45,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84993 to 84993. [2019-11-15 21:30:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84993 states. [2019-11-15 21:30:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84993 states to 84993 states and 119809 transitions. [2019-11-15 21:30:45,218 INFO L711 BuchiCegarLoop]: Abstraction has 84993 states and 119809 transitions. [2019-11-15 21:30:45,218 INFO L591 BuchiCegarLoop]: Abstraction has 84993 states and 119809 transitions. [2019-11-15 21:30:45,218 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 21:30:45,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84993 states and 119809 transitions. [2019-11-15 21:30:45,425 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2019-11-15 21:30:45,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:45,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:45,426 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:30:45,426 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:45,426 INFO L791 eck$LassoCheckResult]: Stem: 259091#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_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 259092#L223-1 [2019-11-15 21:30:45,427 INFO L793 eck$LassoCheckResult]: Loop: 259092#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 259262#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 259258#L91 assume !(0 != main_~p1~0); 259254#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 259250#L95-1 assume !(0 != main_~p3~0); 259243#L99-1 assume !(0 != main_~p4~0); 259235#L103-1 assume !(0 != main_~p5~0); 259227#L107-1 assume !(0 != main_~p6~0); 259219#L111-1 assume !(0 != main_~p7~0); 259211#L115-1 assume !(0 != main_~p8~0); 259203#L119-1 assume !(0 != main_~p9~0); 259195#L123-1 assume !(0 != main_~p10~0); 259190#L127-1 assume !(0 != main_~p11~0); 259183#L131-1 assume !(0 != main_~p12~0); 259175#L135-1 assume !(0 != main_~p13~0); 259170#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 259165#L143-1 assume !(0 != main_~p15~0); 259159#L147-1 assume !(0 != main_~p1~0); 259160#L153-1 assume 0 != main_~p2~0; 259341#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 259339#L158 assume !(0 != main_~p3~0); 259334#L163-1 assume !(0 != main_~p4~0); 259330#L168-1 assume !(0 != main_~p5~0); 259326#L173-1 assume !(0 != main_~p6~0); 259322#L178-1 assume !(0 != main_~p7~0); 259318#L183-1 assume !(0 != main_~p8~0); 259314#L188-1 assume !(0 != main_~p9~0); 259306#L193-1 assume !(0 != main_~p10~0); 259296#L198-1 assume !(0 != main_~p11~0); 259288#L203-1 assume !(0 != main_~p12~0); 259281#L208-1 assume !(0 != main_~p13~0); 259277#L213-1 assume 0 != main_~p14~0; 259273#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 259269#L218 assume !(0 != main_~p15~0); 259092#L223-1 [2019-11-15 21:30:45,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:45,427 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 12 times [2019-11-15 21:30:45,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:45,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809958924] [2019-11-15 21:30:45,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:45,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:45,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:45,446 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:45,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:45,447 INFO L82 PathProgramCache]: Analyzing trace with hash -172790364, now seen corresponding path program 1 times [2019-11-15 21:30:45,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:45,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527318525] [2019-11-15 21:30:45,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:45,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:45,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:45,475 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:45,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1777509891, now seen corresponding path program 1 times [2019-11-15 21:30:45,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:45,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662917654] [2019-11-15 21:30:45,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:45,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:45,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:45,512 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:45,681 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-15 21:30:45,834 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 21:30:45,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:30:45 BoogieIcfgContainer [2019-11-15 21:30:45,975 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:30:45,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:30:45,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:30:45,976 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:30:45,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:30:36" (3/4) ... [2019-11-15 21:30:45,981 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 21:30:46,082 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_647df2a0-8fb8-4905-b23c-d46253bbb426/bin/uautomizer/witness.graphml [2019-11-15 21:30:46,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:30:46,084 INFO L168 Benchmark]: Toolchain (without parser) took 10154.20 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 522.7 MB). Free memory was 941.0 MB in the beginning and 782.7 MB in the end (delta: 158.3 MB). Peak memory consumption was 681.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:30:46,085 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:30:46,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:30:46,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:30:46,087 INFO L168 Benchmark]: Boogie Preprocessor took 29.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:30:46,087 INFO L168 Benchmark]: RCFGBuilder took 465.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:30:46,088 INFO L168 Benchmark]: BuchiAutomizer took 9036.74 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 410.5 MB). Free memory was 1.1 GB in the beginning and 786.1 MB in the end (delta: 286.4 MB). Peak memory consumption was 696.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:30:46,088 INFO L168 Benchmark]: Witness Printer took 106.89 ms. Allocated memory is still 1.6 GB. Free memory was 786.1 MB in the beginning and 782.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:30:46,091 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 451.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 465.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9036.74 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 410.5 MB). Free memory was 1.1 GB in the beginning and 786.1 MB in the end (delta: 286.4 MB). Peak memory consumption was 696.9 MB. Max. memory is 11.5 GB. * Witness Printer took 106.89 ms. Allocated memory is still 1.6 GB. Free memory was 786.1 MB in the beginning and 782.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 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 84993 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 3.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 2.0s Buchi closure took 0.1s. Biggest automaton had 84993 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1260 SDtfs, 648 SDslu, 790 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: 54]: 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=3, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fa689ae=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20221062=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57bcfb99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4acf8746=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6874e7e7=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@202d4fc5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51e5ee9=0, p15=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b9d5997=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59e5d063=0, lk15=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f1da098=0, p14=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18deab33=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@216fb910=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b8cf786=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7bdcbd5d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31c59684=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@200530ca=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 54]: 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; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L48] int p15 = __VERIFIER_nondet_int(); [L49] int lk15; [L52] int cond; Loop: [L54] COND TRUE 1 [L55] cond = __VERIFIER_nondet_int() [L56] COND FALSE !(cond == 0) [L59] lk1 = 0 [L61] lk2 = 0 [L63] lk3 = 0 [L65] lk4 = 0 [L67] lk5 = 0 [L69] lk6 = 0 [L71] lk7 = 0 [L73] lk8 = 0 [L75] lk9 = 0 [L77] lk10 = 0 [L79] lk11 = 0 [L81] lk12 = 0 [L83] lk13 = 0 [L85] lk14 = 0 [L87] lk15 = 0 [L91] COND FALSE !(p1 != 0) [L95] COND TRUE p2 != 0 [L96] lk2 = 1 [L99] COND FALSE !(p3 != 0) [L103] COND FALSE !(p4 != 0) [L107] COND FALSE !(p5 != 0) [L111] COND FALSE !(p6 != 0) [L115] COND FALSE !(p7 != 0) [L119] COND FALSE !(p8 != 0) [L123] COND FALSE !(p9 != 0) [L127] COND FALSE !(p10 != 0) [L131] COND FALSE !(p11 != 0) [L135] COND FALSE !(p12 != 0) [L139] COND FALSE !(p13 != 0) [L143] COND TRUE p14 != 0 [L144] lk14 = 1 [L147] COND FALSE !(p15 != 0) [L153] COND FALSE !(p1 != 0) [L158] COND TRUE p2 != 0 [L159] COND FALSE !(lk2 != 1) [L160] lk2 = 0 [L163] COND FALSE !(p3 != 0) [L168] COND FALSE !(p4 != 0) [L173] COND FALSE !(p5 != 0) [L178] COND FALSE !(p6 != 0) [L183] COND FALSE !(p7 != 0) [L188] COND FALSE !(p8 != 0) [L193] COND FALSE !(p9 != 0) [L198] COND FALSE !(p10 != 0) [L203] COND FALSE !(p11 != 0) [L208] COND FALSE !(p12 != 0) [L213] COND FALSE !(p13 != 0) [L218] COND TRUE p14 != 0 [L219] COND FALSE !(lk14 != 1) [L220] lk14 = 0 [L223] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...