./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_7.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_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_7.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/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 ccd6d122756047ddb1225c106ac06a6748e14c22 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:32:12,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:32:12,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:32:12,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:32:12,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:32:12,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:32:12,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:32:12,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:32:12,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:32:12,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:32:12,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:32:12,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:32:12,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:32:12,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:32:12,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:32:12,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:32:12,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:32:12,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:32:12,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:32:12,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:32:12,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:32:12,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:32:12,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:32:12,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:32:12,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:32:12,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:32:12,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:32:12,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:32:12,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:32:12,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:32:12,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:32:12,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:32:12,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:32:12,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:32:12,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:32:12,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:32:12,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:32:12,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:32:12,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:32:12,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:32:12,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:32:12,870 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:32:12,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:32:12,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:32:12,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:32:12,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:32:12,897 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:32:12,897 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:32:12,898 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:32:12,898 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:32:12,898 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:32:12,898 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:32:12,898 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:32:12,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:32:12,899 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:32:12,899 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:32:12,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:32:12,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:32:12,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:32:12,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:32:12,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:32:12,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:32:12,900 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:32:12,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:32:12,901 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:32:12,901 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:32:12,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:32:12,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:32:12,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:32:12,902 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:32:12,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:32:12,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:32:12,903 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:32:12,903 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:32:12,904 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_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2019-11-16 00:32:12,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:32:12,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:32:12,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:32:12,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:32:12,942 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:32:12,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_7.c [2019-11-16 00:32:12,992 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/data/27ab9aea1/d48e4a7a3dd740ce85a4563039a21cf2/FLAGb53ec9068 [2019-11-16 00:32:13,361 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:32:13,362 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/sv-benchmarks/c/locks/test_locks_7.c [2019-11-16 00:32:13,369 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/data/27ab9aea1/d48e4a7a3dd740ce85a4563039a21cf2/FLAGb53ec9068 [2019-11-16 00:32:13,734 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/data/27ab9aea1/d48e4a7a3dd740ce85a4563039a21cf2 [2019-11-16 00:32:13,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:32:13,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:32:13,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:13,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:32:13,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:32:13,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:13" (1/1) ... [2019-11-16 00:32:13,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d55675c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:13, skipping insertion in model container [2019-11-16 00:32:13,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:13" (1/1) ... [2019-11-16 00:32:13,752 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:32:13,769 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:32:14,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:14,019 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:32:14,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:14,054 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:32:14,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14 WrapperNode [2019-11-16 00:32:14,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:14,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:14,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:32:14,056 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:32:14,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14" (1/1) ... [2019-11-16 00:32:14,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14" (1/1) ... [2019-11-16 00:32:14,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:14,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:32:14,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:32:14,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:32:14,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14" (1/1) ... [2019-11-16 00:32:14,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14" (1/1) ... [2019-11-16 00:32:14,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14" (1/1) ... [2019-11-16 00:32:14,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14" (1/1) ... [2019-11-16 00:32:14,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14" (1/1) ... [2019-11-16 00:32:14,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14" (1/1) ... [2019-11-16 00:32:14,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14" (1/1) ... [2019-11-16 00:32:14,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:32:14,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:32:14,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:32:14,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:32:14,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:32:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:32:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:32:14,526 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:32:14,526 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:32:14,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:14 BoogieIcfgContainer [2019-11-16 00:32:14,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:32:14,528 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:32:14,528 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:32:14,531 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:32:14,532 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:32:14,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:32:13" (1/3) ... [2019-11-16 00:32:14,533 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4da8db2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:32:14, skipping insertion in model container [2019-11-16 00:32:14,533 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:32:14,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:14" (2/3) ... [2019-11-16 00:32:14,534 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4da8db2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:32:14, skipping insertion in model container [2019-11-16 00:32:14,534 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:32:14,534 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:14" (3/3) ... [2019-11-16 00:32:14,535 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2019-11-16 00:32:14,581 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:32:14,581 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:32:14,581 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:32:14,583 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:32:14,583 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:32:14,583 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:32:14,583 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:32:14,583 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:32:14,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2019-11-16 00:32:14,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-16 00:32:14,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:14,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:14,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:32:14,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:14,619 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:32:14,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2019-11-16 00:32:14,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-16 00:32:14,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:14,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:14,622 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:32:14,622 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:14,630 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_~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_~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;havoc main_~cond~0; 18#L111-1true [2019-11-16 00:32:14,630 INFO L793 eck$LassoCheckResult]: Loop: 18#L111-1true assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 11#L32true 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; 8#L51true assume 0 != main_~p1~0;main_~lk1~0 := 1; 6#L51-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 29#L55-1true assume !(0 != main_~p3~0); 20#L59-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 24#L63-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 15#L67-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 4#L71-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 25#L75-1true assume !(0 != main_~p1~0); 21#L81-1true assume !(0 != main_~p2~0); 27#L86-1true assume !(0 != main_~p3~0); 3#L91-1true assume !(0 != main_~p4~0); 10#L96-1true assume !(0 != main_~p5~0); 31#L101-1true assume !(0 != main_~p6~0); 9#L106-1true assume !(0 != main_~p7~0); 18#L111-1true [2019-11-16 00:32:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:14,636 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-16 00:32:14,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:14,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188372573] [2019-11-16 00:32:14,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:14,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:14,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:14,725 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:14,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:14,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1253571452, now seen corresponding path program 1 times [2019-11-16 00:32:14,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:14,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929388218] [2019-11-16 00:32:14,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:14,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:14,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:14,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929388218] [2019-11-16 00:32:14,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:14,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:32:14,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170644471] [2019-11-16 00:32:14,815 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:32:14,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:14,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:14,833 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-11-16 00:32:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:14,869 INFO L93 Difference]: Finished difference Result 56 states and 93 transitions. [2019-11-16 00:32:14,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:14,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 93 transitions. [2019-11-16 00:32:14,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-11-16 00:32:14,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 46 states and 72 transitions. [2019-11-16 00:32:14,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-11-16 00:32:14,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-11-16 00:32:14,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 72 transitions. [2019-11-16 00:32:14,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:32:14,882 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 72 transitions. [2019-11-16 00:32:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 72 transitions. [2019-11-16 00:32:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-16 00:32:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-16 00:32:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 72 transitions. [2019-11-16 00:32:14,911 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 72 transitions. [2019-11-16 00:32:14,911 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 72 transitions. [2019-11-16 00:32:14,911 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:32:14,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 72 transitions. [2019-11-16 00:32:14,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-11-16 00:32:14,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:14,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:14,914 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:32:14,914 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:14,914 INFO L791 eck$LassoCheckResult]: Stem: 119#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_~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_~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;havoc main_~cond~0; 120#L111-1 [2019-11-16 00:32:14,914 INFO L793 eck$LassoCheckResult]: Loop: 120#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 128#L32 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; 127#L51 assume !(0 != main_~p1~0); 108#L51-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 109#L55-1 assume !(0 != main_~p3~0); 97#L59-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 98#L63-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 122#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 106#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 107#L75-1 assume !(0 != main_~p1~0); 123#L81-1 assume !(0 != main_~p2~0); 138#L86-1 assume !(0 != main_~p3~0); 136#L91-1 assume !(0 != main_~p4~0); 134#L96-1 assume !(0 != main_~p5~0); 132#L101-1 assume !(0 != main_~p6~0); 130#L106-1 assume !(0 != main_~p7~0); 120#L111-1 [2019-11-16 00:32:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:14,915 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-16 00:32:14,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:14,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057469627] [2019-11-16 00:32:14,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:14,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:14,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:14,924 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:14,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2030278594, now seen corresponding path program 1 times [2019-11-16 00:32:14,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:14,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246921676] [2019-11-16 00:32:14,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:14,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:14,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:14,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246921676] [2019-11-16 00:32:14,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:14,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:32:14,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404401639] [2019-11-16 00:32:14,952 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:32:14,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:14,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:14,953 INFO L87 Difference]: Start difference. First operand 46 states and 72 transitions. cyclomatic complexity: 28 Second operand 3 states. [2019-11-16 00:32:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:14,978 INFO L93 Difference]: Finished difference Result 89 states and 137 transitions. [2019-11-16 00:32:14,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:14,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 137 transitions. [2019-11-16 00:32:14,982 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2019-11-16 00:32:14,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 137 transitions. [2019-11-16 00:32:14,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2019-11-16 00:32:14,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-11-16 00:32:14,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 137 transitions. [2019-11-16 00:32:14,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:32:14,986 INFO L688 BuchiCegarLoop]: Abstraction has 89 states and 137 transitions. [2019-11-16 00:32:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 137 transitions. [2019-11-16 00:32:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-16 00:32:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-16 00:32:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2019-11-16 00:32:14,995 INFO L711 BuchiCegarLoop]: Abstraction has 89 states and 137 transitions. [2019-11-16 00:32:14,995 INFO L591 BuchiCegarLoop]: Abstraction has 89 states and 137 transitions. [2019-11-16 00:32:14,996 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:32:14,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 137 transitions. [2019-11-16 00:32:14,998 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2019-11-16 00:32:14,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:14,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:14,999 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:32:14,999 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:14,999 INFO L791 eck$LassoCheckResult]: Stem: 258#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_~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_~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;havoc main_~cond~0; 243#L111-1 [2019-11-16 00:32:14,999 INFO L793 eck$LassoCheckResult]: Loop: 243#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 259#L32 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; 260#L51 assume !(0 != main_~p1~0); 264#L51-2 assume !(0 != main_~p2~0); 262#L55-1 assume !(0 != main_~p3~0); 235#L59-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 236#L63-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 254#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 302#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 301#L75-1 assume !(0 != main_~p1~0); 299#L81-1 assume !(0 != main_~p2~0); 298#L86-1 assume !(0 != main_~p3~0); 237#L91-1 assume !(0 != main_~p4~0); 238#L96-1 assume !(0 != main_~p5~0); 247#L101-1 assume !(0 != main_~p6~0); 255#L106-1 assume !(0 != main_~p7~0); 243#L111-1 [2019-11-16 00:32:15,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,000 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-16 00:32:15,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829587907] [2019-11-16 00:32:15,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,009 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:15,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1443472580, now seen corresponding path program 1 times [2019-11-16 00:32:15,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513713385] [2019-11-16 00:32:15,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:15,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513713385] [2019-11-16 00:32:15,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:15,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:32:15,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095937165] [2019-11-16 00:32:15,036 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:32:15,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:15,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:15,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:15,037 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. cyclomatic complexity: 52 Second operand 3 states. [2019-11-16 00:32:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:15,078 INFO L93 Difference]: Finished difference Result 173 states and 261 transitions. [2019-11-16 00:32:15,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:15,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 261 transitions. [2019-11-16 00:32:15,082 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2019-11-16 00:32:15,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 261 transitions. [2019-11-16 00:32:15,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2019-11-16 00:32:15,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2019-11-16 00:32:15,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 261 transitions. [2019-11-16 00:32:15,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:32:15,087 INFO L688 BuchiCegarLoop]: Abstraction has 173 states and 261 transitions. [2019-11-16 00:32:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 261 transitions. [2019-11-16 00:32:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-11-16 00:32:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-16 00:32:15,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 261 transitions. [2019-11-16 00:32:15,110 INFO L711 BuchiCegarLoop]: Abstraction has 173 states and 261 transitions. [2019-11-16 00:32:15,110 INFO L591 BuchiCegarLoop]: Abstraction has 173 states and 261 transitions. [2019-11-16 00:32:15,110 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:32:15,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 261 transitions. [2019-11-16 00:32:15,112 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2019-11-16 00:32:15,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:15,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:15,113 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:32:15,113 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:15,119 INFO L791 eck$LassoCheckResult]: Stem: 525#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_~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_~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;havoc main_~cond~0; 526#L111-1 [2019-11-16 00:32:15,119 INFO L793 eck$LassoCheckResult]: Loop: 526#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 586#L32 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; 540#L51 assume !(0 != main_~p1~0); 541#L51-2 assume !(0 != main_~p2~0); 619#L55-1 assume !(0 != main_~p3~0); 618#L59-1 assume !(0 != main_~p4~0); 576#L63-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 577#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 570#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 571#L75-1 assume !(0 != main_~p1~0); 606#L81-1 assume !(0 != main_~p2~0); 603#L86-1 assume !(0 != main_~p3~0); 598#L91-1 assume !(0 != main_~p4~0); 596#L96-1 assume !(0 != main_~p5~0); 593#L101-1 assume !(0 != main_~p6~0); 588#L106-1 assume !(0 != main_~p7~0); 526#L111-1 [2019-11-16 00:32:15,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,120 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-16 00:32:15,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861192030] [2019-11-16 00:32:15,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,129 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:15,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2144537158, now seen corresponding path program 1 times [2019-11-16 00:32:15,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521200860] [2019-11-16 00:32:15,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:15,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521200860] [2019-11-16 00:32:15,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:15,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:32:15,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487817643] [2019-11-16 00:32:15,167 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:32:15,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:15,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:15,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:15,168 INFO L87 Difference]: Start difference. First operand 173 states and 261 transitions. cyclomatic complexity: 96 Second operand 3 states. [2019-11-16 00:32:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:15,186 INFO L93 Difference]: Finished difference Result 337 states and 497 transitions. [2019-11-16 00:32:15,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:15,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 497 transitions. [2019-11-16 00:32:15,190 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2019-11-16 00:32:15,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 337 states and 497 transitions. [2019-11-16 00:32:15,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 337 [2019-11-16 00:32:15,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 337 [2019-11-16 00:32:15,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 497 transitions. [2019-11-16 00:32:15,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:32:15,198 INFO L688 BuchiCegarLoop]: Abstraction has 337 states and 497 transitions. [2019-11-16 00:32:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 497 transitions. [2019-11-16 00:32:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2019-11-16 00:32:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-11-16 00:32:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 497 transitions. [2019-11-16 00:32:15,219 INFO L711 BuchiCegarLoop]: Abstraction has 337 states and 497 transitions. [2019-11-16 00:32:15,220 INFO L591 BuchiCegarLoop]: Abstraction has 337 states and 497 transitions. [2019-11-16 00:32:15,220 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:32:15,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 337 states and 497 transitions. [2019-11-16 00:32:15,222 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2019-11-16 00:32:15,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:15,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:15,230 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:32:15,230 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:15,230 INFO L791 eck$LassoCheckResult]: Stem: 1044#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_~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_~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;havoc main_~cond~0; 1045#L111-1 [2019-11-16 00:32:15,230 INFO L793 eck$LassoCheckResult]: Loop: 1045#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 1190#L32 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; 1197#L51 assume !(0 != main_~p1~0); 1195#L51-2 assume !(0 != main_~p2~0); 1133#L55-1 assume !(0 != main_~p3~0); 1134#L59-1 assume !(0 != main_~p4~0); 1119#L63-1 assume !(0 != main_~p5~0); 1121#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1105#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1106#L75-1 assume !(0 != main_~p1~0); 1187#L81-1 assume !(0 != main_~p2~0); 1189#L86-1 assume !(0 != main_~p3~0); 1210#L91-1 assume !(0 != main_~p4~0); 1209#L96-1 assume !(0 != main_~p5~0); 1208#L101-1 assume !(0 != main_~p6~0); 1203#L106-1 assume !(0 != main_~p7~0); 1045#L111-1 [2019-11-16 00:32:15,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,230 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-16 00:32:15,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405495076] [2019-11-16 00:32:15,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,237 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:15,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1751510148, now seen corresponding path program 1 times [2019-11-16 00:32:15,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889105792] [2019-11-16 00:32:15,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:15,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889105792] [2019-11-16 00:32:15,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:15,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:32:15,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159385205] [2019-11-16 00:32:15,279 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:32:15,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:15,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:15,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:15,280 INFO L87 Difference]: Start difference. First operand 337 states and 497 transitions. cyclomatic complexity: 176 Second operand 3 states. [2019-11-16 00:32:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:15,315 INFO L93 Difference]: Finished difference Result 657 states and 945 transitions. [2019-11-16 00:32:15,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:15,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 657 states and 945 transitions. [2019-11-16 00:32:15,323 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2019-11-16 00:32:15,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 657 states to 657 states and 945 transitions. [2019-11-16 00:32:15,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 657 [2019-11-16 00:32:15,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 657 [2019-11-16 00:32:15,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 657 states and 945 transitions. [2019-11-16 00:32:15,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:32:15,335 INFO L688 BuchiCegarLoop]: Abstraction has 657 states and 945 transitions. [2019-11-16 00:32:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states and 945 transitions. [2019-11-16 00:32:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-11-16 00:32:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-16 00:32:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 945 transitions. [2019-11-16 00:32:15,367 INFO L711 BuchiCegarLoop]: Abstraction has 657 states and 945 transitions. [2019-11-16 00:32:15,367 INFO L591 BuchiCegarLoop]: Abstraction has 657 states and 945 transitions. [2019-11-16 00:32:15,367 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:32:15,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 657 states and 945 transitions. [2019-11-16 00:32:15,371 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2019-11-16 00:32:15,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:15,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:15,372 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:32:15,372 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:15,372 INFO L791 eck$LassoCheckResult]: Stem: 2042#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_~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_~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;havoc main_~cond~0; 2043#L111-1 [2019-11-16 00:32:15,372 INFO L793 eck$LassoCheckResult]: Loop: 2043#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 2126#L32 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; 2122#L51 assume !(0 != main_~p1~0); 2118#L51-2 assume !(0 != main_~p2~0); 2116#L55-1 assume !(0 != main_~p3~0); 2114#L59-1 assume !(0 != main_~p4~0); 2110#L63-1 assume !(0 != main_~p5~0); 2106#L67-1 assume !(0 != main_~p6~0); 2104#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2100#L75-1 assume !(0 != main_~p1~0); 2096#L81-1 assume !(0 != main_~p2~0); 2093#L86-1 assume !(0 != main_~p3~0); 2089#L91-1 assume !(0 != main_~p4~0); 2090#L96-1 assume !(0 != main_~p5~0); 2133#L101-1 assume !(0 != main_~p6~0); 2130#L106-1 assume !(0 != main_~p7~0); 2043#L111-1 [2019-11-16 00:32:15,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,373 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-16 00:32:15,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922836440] [2019-11-16 00:32:15,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,386 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:15,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1863398778, now seen corresponding path program 1 times [2019-11-16 00:32:15,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605807412] [2019-11-16 00:32:15,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:15,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605807412] [2019-11-16 00:32:15,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:15,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:32:15,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891002566] [2019-11-16 00:32:15,423 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:32:15,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:15,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:15,424 INFO L87 Difference]: Start difference. First operand 657 states and 945 transitions. cyclomatic complexity: 320 Second operand 3 states. [2019-11-16 00:32:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:15,463 INFO L93 Difference]: Finished difference Result 1281 states and 1793 transitions. [2019-11-16 00:32:15,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:15,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1281 states and 1793 transitions. [2019-11-16 00:32:15,476 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2019-11-16 00:32:15,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1281 states to 1281 states and 1793 transitions. [2019-11-16 00:32:15,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1281 [2019-11-16 00:32:15,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1281 [2019-11-16 00:32:15,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1281 states and 1793 transitions. [2019-11-16 00:32:15,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:32:15,492 INFO L688 BuchiCegarLoop]: Abstraction has 1281 states and 1793 transitions. [2019-11-16 00:32:15,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states and 1793 transitions. [2019-11-16 00:32:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1281. [2019-11-16 00:32:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2019-11-16 00:32:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1793 transitions. [2019-11-16 00:32:15,527 INFO L711 BuchiCegarLoop]: Abstraction has 1281 states and 1793 transitions. [2019-11-16 00:32:15,527 INFO L591 BuchiCegarLoop]: Abstraction has 1281 states and 1793 transitions. [2019-11-16 00:32:15,527 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:32:15,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1281 states and 1793 transitions. [2019-11-16 00:32:15,534 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2019-11-16 00:32:15,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:15,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:15,535 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:32:15,535 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:15,535 INFO L791 eck$LassoCheckResult]: Stem: 3988#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_~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_~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;havoc main_~cond~0; 3989#L111-1 [2019-11-16 00:32:15,536 INFO L793 eck$LassoCheckResult]: Loop: 3989#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 4197#L32 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; 4193#L51 assume !(0 != main_~p1~0); 4190#L51-2 assume !(0 != main_~p2~0); 4187#L55-1 assume !(0 != main_~p3~0); 4185#L59-1 assume !(0 != main_~p4~0); 4183#L63-1 assume !(0 != main_~p5~0); 4177#L67-1 assume !(0 != main_~p6~0); 4178#L71-1 assume !(0 != main_~p7~0); 4212#L75-1 assume !(0 != main_~p1~0); 4363#L81-1 assume !(0 != main_~p2~0); 4360#L86-1 assume !(0 != main_~p3~0); 4137#L91-1 assume !(0 != main_~p4~0); 4138#L96-1 assume !(0 != main_~p5~0); 4103#L101-1 assume !(0 != main_~p6~0); 4104#L106-1 assume !(0 != main_~p7~0); 3989#L111-1 [2019-11-16 00:32:15,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,536 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-16 00:32:15,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670142318] [2019-11-16 00:32:15,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,549 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:15,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1622221892, now seen corresponding path program 1 times [2019-11-16 00:32:15,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352191861] [2019-11-16 00:32:15,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,563 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,564 INFO L82 PathProgramCache]: Analyzing trace with hash 625149539, now seen corresponding path program 1 times [2019-11-16 00:32:15,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884924087] [2019-11-16 00:32:15,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:15,578 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:15,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:32:15 BoogieIcfgContainer [2019-11-16 00:32:15,778 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:32:15,778 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:32:15,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:32:15,779 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:32:15,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:14" (3/4) ... [2019-11-16 00:32:15,782 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-16 00:32:15,841 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ea3a78ab-a749-4fc1-92cc-a7e1bf90cca4/bin/uautomizer/witness.graphml [2019-11-16 00:32:15,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:32:15,843 INFO L168 Benchmark]: Toolchain (without parser) took 2105.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.5 MB in the beginning and 1.0 GB in the end (delta: -59.8 MB). Peak memory consumption was 88.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:15,843 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:32:15,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:15,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:32:15,845 INFO L168 Benchmark]: Boogie Preprocessor took 22.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:32:15,845 INFO L168 Benchmark]: RCFGBuilder took 416.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:15,846 INFO L168 Benchmark]: BuchiAutomizer took 1250.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:15,846 INFO L168 Benchmark]: Witness Printer took 62.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:15,848 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 416.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1250.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 11.5 GB. * Witness Printer took 62.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1281 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1281 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 344 SDtfs, 179 SDslu, 202 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI6 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: 30]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@77fa657e=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@dd3a1e9=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c8ff534=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c71c6e2=0, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67365c98=0, lk6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52da60ff=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ba964fb=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3255213d=0, cond=1, lk7=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 30]: 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; [L28] int cond; Loop: [L30] COND TRUE 1 [L31] cond = __VERIFIER_nondet_int() [L32] COND FALSE !(cond == 0) [L35] lk1 = 0 [L37] lk2 = 0 [L39] lk3 = 0 [L41] lk4 = 0 [L43] lk5 = 0 [L45] lk6 = 0 [L47] lk7 = 0 [L51] COND FALSE !(p1 != 0) [L55] COND FALSE !(p2 != 0) [L59] COND FALSE !(p3 != 0) [L63] COND FALSE !(p4 != 0) [L67] COND FALSE !(p5 != 0) [L71] COND FALSE !(p6 != 0) [L75] COND FALSE !(p7 != 0) [L81] COND FALSE !(p1 != 0) [L86] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L96] COND FALSE !(p4 != 0) [L101] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L111] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...