./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 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_7.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d2a1f90505878c0035f7701a954d17ca4375eb05 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.multireach-323-8d31f38 [2021-07-06 19:03:54,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 19:03:54,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 19:03:54,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 19:03:54,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 19:03:54,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 19:03:54,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 19:03:54,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 19:03:54,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 19:03:54,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 19:03:54,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 19:03:54,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 19:03:54,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 19:03:54,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 19:03:54,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 19:03:54,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 19:03:54,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 19:03:54,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 19:03:54,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 19:03:54,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 19:03:54,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 19:03:54,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 19:03:54,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 19:03:54,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 19:03:54,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 19:03:54,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 19:03:54,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 19:03:54,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 19:03:54,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 19:03:54,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 19:03:54,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 19:03:54,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 19:03:54,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 19:03:54,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 19:03:54,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 19:03:54,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 19:03:54,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 19:03:54,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 19:03:54,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 19:03:54,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 19:03:54,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 19:03:54,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-07-06 19:03:54,710 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 19:03:54,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 19:03:54,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 19:03:54,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 19:03:54,712 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 19:03:54,712 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 19:03:54,713 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 19:03:54,713 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 19:03:54,713 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 19:03:54,713 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 19:03:54,714 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 19:03:54,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 19:03:54,714 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 19:03:54,714 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 19:03:54,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 19:03:54,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 19:03:54,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 19:03:54,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 19:03:54,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 19:03:54,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 19:03:54,715 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 19:03:54,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 19:03:54,716 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 19:03:54,716 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 19:03:54,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 19:03:54,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 19:03:54,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 19:03:54,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 19:03:54,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 19:03:54,717 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 19:03:54,718 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 19:03:54,718 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d2a1f90505878c0035f7701a954d17ca4375eb05 [2021-07-06 19:03:55,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 19:03:55,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 19:03:55,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 19:03:55,071 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 19:03:55,072 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 19:03:55,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2021-07-06 19:03:55,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6899b3a71/eca5da60c2ba4bec8ce795921b61ad65/FLAG0eb800bec [2021-07-06 19:03:55,546 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 19:03:55,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2021-07-06 19:03:55,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6899b3a71/eca5da60c2ba4bec8ce795921b61ad65/FLAG0eb800bec [2021-07-06 19:03:55,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6899b3a71/eca5da60c2ba4bec8ce795921b61ad65 [2021-07-06 19:03:55,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 19:03:55,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 19:03:55,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 19:03:55,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 19:03:55,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 19:03:55,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 07:03:55" (1/1) ... [2021-07-06 19:03:55,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f16b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:55, skipping insertion in model container [2021-07-06 19:03:55,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 07:03:55" (1/1) ... [2021-07-06 19:03:55,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 19:03:55,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 19:03:56,143 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2021-07-06 19:03:56,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 19:03:56,152 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 19:03:56,170 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2021-07-06 19:03:56,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 19:03:56,191 INFO L208 MainTranslator]: Completed translation [2021-07-06 19:03:56,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56 WrapperNode [2021-07-06 19:03:56,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 19:03:56,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 19:03:56,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 19:03:56,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 19:03:56,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 19:03:56,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 19:03:56,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 19:03:56,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 19:03:56,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 19:03:56,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 19:03:56,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 19:03:56,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 19:03:56,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (1/1) ... [2021-07-06 19:03:56,287 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 19:03:56,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 19:03:56,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-07-06 19:03:56,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-07-06 19:03:56,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 19:03:56,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 19:03:56,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 19:03:56,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 19:03:56,729 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 19:03:56,731 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-07-06 19:03:56,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:03:56 BoogieIcfgContainer [2021-07-06 19:03:56,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 19:03:56,733 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 19:03:56,733 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 19:03:56,736 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 19:03:56,737 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:56,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 07:03:55" (1/3) ... [2021-07-06 19:03:56,739 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59c63044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 07:03:56, skipping insertion in model container [2021-07-06 19:03:56,739 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:56,739 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:03:56" (2/3) ... [2021-07-06 19:03:56,739 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59c63044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 07:03:56, skipping insertion in model container [2021-07-06 19:03:56,739 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:03:56,739 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:03:56" (3/3) ... [2021-07-06 19:03:56,741 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2021-07-06 19:03:56,788 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 19:03:56,789 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 19:03:56,789 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 19:03:56,789 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 19:03:56,789 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 19:03:56,789 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 19:03:56,789 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 19:03:56,790 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 19:03:56,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:56,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-07-06 19:03:56,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:56,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:56,826 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:56,826 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:56,826 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 19:03:56,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:56,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-07-06 19:03:56,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:56,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:56,831 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:56,831 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:56,837 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 4#L113-1true [2021-07-06 19:03:56,838 INFO L793 eck$LassoCheckResult]: Loop: 4#L113-1true assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 14#L34true 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; 25#L53true assume 0 != main_~p1~0;main_~lk1~0 := 1; 8#L53-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 31#L57-1true assume !(0 != main_~p3~0); 21#L61-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 11#L65-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 18#L69-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 6#L73-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 28#L77-1true assume !(0 != main_~p1~0); 22#L83-1true assume !(0 != main_~p2~0); 30#L88-1true assume !(0 != main_~p3~0); 5#L93-1true assume !(0 != main_~p4~0); 12#L98-1true assume !(0 != main_~p5~0); 19#L103-1true assume !(0 != main_~p6~0); 27#L108-1true assume !(0 != main_~p7~0); 4#L113-1true [2021-07-06 19:03:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:56,844 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-07-06 19:03:56,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:56,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659165897] [2021-07-06 19:03:56,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:56,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:56,954 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:56,980 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,004 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2021-07-06 19:03:57,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823755548] [2021-07-06 19:03:57,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823755548] [2021-07-06 19:03:57,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823755548] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:57,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264054187] [2021-07-06 19:03:57,106 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,128 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,182 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2021-07-06 19:03:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 94 transitions. [2021-07-06 19:03:57,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-07-06 19:03:57,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 73 transitions. [2021-07-06 19:03:57,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-07-06 19:03:57,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-07-06 19:03:57,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2021-07-06 19:03:57,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,200 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-07-06 19:03:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2021-07-06 19:03:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-07-06 19:03:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2021-07-06 19:03:57,232 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-07-06 19:03:57,233 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-07-06 19:03:57,233 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 19:03:57,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2021-07-06 19:03:57,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-07-06 19:03:57,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,238 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,238 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,238 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 109#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 110#L113-1 [2021-07-06 19:03:57,238 INFO L793 eck$LassoCheckResult]: Loop: 110#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 114#L34 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; 115#L53 assume !(0 != main_~p1~0); 133#L53-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 132#L57-1 assume !(0 != main_~p3~0); 120#L61-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 111#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 112#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 103#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 104#L77-1 assume !(0 != main_~p1~0); 121#L83-1 assume !(0 != main_~p2~0); 119#L88-1 assume !(0 != main_~p3~0); 98#L93-1 assume !(0 != main_~p4~0); 99#L98-1 assume !(0 != main_~p5~0); 136#L103-1 assume !(0 != main_~p6~0); 126#L108-1 assume !(0 != main_~p7~0); 110#L113-1 [2021-07-06 19:03:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-07-06 19:03:57,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77314140] [2021-07-06 19:03:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,259 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,274 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,282 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2021-07-06 19:03:57,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938147231] [2021-07-06 19:03:57,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938147231] [2021-07-06 19:03:57,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938147231] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:57,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412542304] [2021-07-06 19:03:57,329 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,330 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,363 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2021-07-06 19:03:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2021-07-06 19:03:57,369 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2021-07-06 19:03:57,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2021-07-06 19:03:57,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2021-07-06 19:03:57,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2021-07-06 19:03:57,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2021-07-06 19:03:57,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,375 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-07-06 19:03:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2021-07-06 19:03:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-07-06 19:03:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2021-07-06 19:03:57,390 INFO L704 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-07-06 19:03:57,390 INFO L587 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-07-06 19:03:57,396 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 19:03:57,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2021-07-06 19:03:57,402 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2021-07-06 19:03:57,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,403 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,403 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,403 INFO L791 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 252#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 253#L113-1 [2021-07-06 19:03:57,403 INFO L793 eck$LassoCheckResult]: Loop: 253#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 284#L34 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; 282#L53 assume !(0 != main_~p1~0); 280#L53-2 assume !(0 != main_~p2~0); 277#L57-1 assume !(0 != main_~p3~0); 262#L61-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 254#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 255#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 244#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 245#L77-1 assume !(0 != main_~p1~0); 309#L83-1 assume !(0 != main_~p2~0); 304#L88-1 assume !(0 != main_~p3~0); 300#L93-1 assume !(0 != main_~p4~0); 297#L98-1 assume !(0 != main_~p5~0); 292#L103-1 assume !(0 != main_~p6~0); 288#L108-1 assume !(0 != main_~p7~0); 253#L113-1 [2021-07-06 19:03:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-07-06 19:03:57,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931463530] [2021-07-06 19:03:57,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,412 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,432 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,437 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,438 INFO L82 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2021-07-06 19:03:57,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411732832] [2021-07-06 19:03:57,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411732832] [2021-07-06 19:03:57,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411732832] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:57,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082149001] [2021-07-06 19:03:57,485 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,486 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,507 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2021-07-06 19:03:57,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2021-07-06 19:03:57,509 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2021-07-06 19:03:57,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2021-07-06 19:03:57,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2021-07-06 19:03:57,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2021-07-06 19:03:57,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2021-07-06 19:03:57,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,512 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-07-06 19:03:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2021-07-06 19:03:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-07-06 19:03:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2021-07-06 19:03:57,521 INFO L704 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-07-06 19:03:57,521 INFO L587 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-07-06 19:03:57,521 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 19:03:57,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2021-07-06 19:03:57,523 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2021-07-06 19:03:57,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,523 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,523 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,524 INFO L791 eck$LassoCheckResult]: Stem: 539#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 521#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 522#L113-1 [2021-07-06 19:03:57,524 INFO L793 eck$LassoCheckResult]: Loop: 522#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 566#L34 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; 609#L53 assume !(0 != main_~p1~0); 607#L53-2 assume !(0 != main_~p2~0); 606#L57-1 assume !(0 != main_~p3~0); 603#L61-1 assume !(0 != main_~p4~0); 601#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 599#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 597#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 594#L77-1 assume !(0 != main_~p1~0); 595#L83-1 assume !(0 != main_~p2~0); 587#L88-1 assume !(0 != main_~p3~0); 586#L93-1 assume !(0 != main_~p4~0); 577#L98-1 assume !(0 != main_~p5~0); 578#L103-1 assume !(0 != main_~p6~0); 570#L108-1 assume !(0 != main_~p7~0); 522#L113-1 [2021-07-06 19:03:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-07-06 19:03:57,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700183867] [2021-07-06 19:03:57,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,532 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,539 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,542 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2021-07-06 19:03:57,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556730488] [2021-07-06 19:03:57,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556730488] [2021-07-06 19:03:57,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556730488] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:57,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702803042] [2021-07-06 19:03:57,562 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,563 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,577 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2021-07-06 19:03:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2021-07-06 19:03:57,581 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2021-07-06 19:03:57,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2021-07-06 19:03:57,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2021-07-06 19:03:57,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2021-07-06 19:03:57,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2021-07-06 19:03:57,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,589 INFO L681 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-07-06 19:03:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2021-07-06 19:03:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2021-07-06 19:03:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2021-07-06 19:03:57,602 INFO L704 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-07-06 19:03:57,603 INFO L587 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-07-06 19:03:57,603 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-07-06 19:03:57,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2021-07-06 19:03:57,609 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2021-07-06 19:03:57,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,610 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,610 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,610 INFO L791 eck$LassoCheckResult]: Stem: 1062#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1039#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 1040#L113-1 [2021-07-06 19:03:57,610 INFO L793 eck$LassoCheckResult]: Loop: 1040#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 1117#L34 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; 1115#L53 assume !(0 != main_~p1~0); 1111#L53-2 assume !(0 != main_~p2~0); 1109#L57-1 assume !(0 != main_~p3~0); 1105#L61-1 assume !(0 != main_~p4~0); 1102#L65-1 assume !(0 != main_~p5~0); 1100#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1098#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1095#L77-1 assume !(0 != main_~p1~0); 1096#L83-1 assume !(0 != main_~p2~0); 1135#L88-1 assume !(0 != main_~p3~0); 1130#L93-1 assume !(0 != main_~p4~0); 1128#L98-1 assume !(0 != main_~p5~0); 1125#L103-1 assume !(0 != main_~p6~0); 1121#L108-1 assume !(0 != main_~p7~0); 1040#L113-1 [2021-07-06 19:03:57,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,611 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-07-06 19:03:57,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301809325] [2021-07-06 19:03:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,617 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,630 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,633 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,633 INFO L82 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2021-07-06 19:03:57,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272237074] [2021-07-06 19:03:57,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272237074] [2021-07-06 19:03:57,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272237074] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 19:03:57,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259591113] [2021-07-06 19:03:57,657 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,658 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,674 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2021-07-06 19:03:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2021-07-06 19:03:57,680 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2021-07-06 19:03:57,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2021-07-06 19:03:57,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2021-07-06 19:03:57,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2021-07-06 19:03:57,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2021-07-06 19:03:57,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,688 INFO L681 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-07-06 19:03:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2021-07-06 19:03:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2021-07-06 19:03:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2021-07-06 19:03:57,706 INFO L704 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-07-06 19:03:57,706 INFO L587 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-07-06 19:03:57,706 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-07-06 19:03:57,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2021-07-06 19:03:57,710 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2021-07-06 19:03:57,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,710 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,710 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,711 INFO L791 eck$LassoCheckResult]: Stem: 2062#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2041#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 2042#L113-1 [2021-07-06 19:03:57,711 INFO L793 eck$LassoCheckResult]: Loop: 2042#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 2240#L34 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; 2234#L53 assume !(0 != main_~p1~0); 2228#L53-2 assume !(0 != main_~p2~0); 2215#L57-1 assume !(0 != main_~p3~0); 2216#L61-1 assume !(0 != main_~p4~0); 2220#L65-1 assume !(0 != main_~p5~0); 2221#L69-1 assume !(0 != main_~p6~0); 2274#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2272#L77-1 assume !(0 != main_~p1~0); 2270#L83-1 assume !(0 != main_~p2~0); 2269#L88-1 assume !(0 != main_~p3~0); 2255#L93-1 assume !(0 != main_~p4~0); 2254#L98-1 assume !(0 != main_~p5~0); 2252#L103-1 assume !(0 != main_~p6~0); 2246#L108-1 assume !(0 != main_~p7~0); 2042#L113-1 [2021-07-06 19:03:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,711 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-07-06 19:03:57,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182553502] [2021-07-06 19:03:57,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,718 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,722 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,725 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2021-07-06 19:03:57,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237638617] [2021-07-06 19:03:57,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:03:57,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:03:57,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 19:03:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:03:57,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:03:57,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237638617] [2021-07-06 19:03:57,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237638617] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:03:57,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:03:57,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-06 19:03:57,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135293677] [2021-07-06 19:03:57,743 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:03:57,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:03:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 19:03:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 19:03:57,744 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:03:57,762 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2021-07-06 19:03:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 19:03:57,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2021-07-06 19:03:57,788 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2021-07-06 19:03:57,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2021-07-06 19:03:57,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2021-07-06 19:03:57,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2021-07-06 19:03:57,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2021-07-06 19:03:57,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:03:57,801 INFO L681 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-07-06 19:03:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2021-07-06 19:03:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2021-07-06 19:03:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:03:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2021-07-06 19:03:57,826 INFO L704 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-07-06 19:03:57,826 INFO L587 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-07-06 19:03:57,827 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-07-06 19:03:57,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2021-07-06 19:03:57,833 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2021-07-06 19:03:57,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:03:57,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:03:57,834 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:03:57,834 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:03:57,834 INFO L791 eck$LassoCheckResult]: Stem: 4007#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3987#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 3988#L113-1 [2021-07-06 19:03:57,834 INFO L793 eck$LassoCheckResult]: Loop: 3988#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 4293#L34 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; 4291#L53 assume !(0 != main_~p1~0); 4287#L53-2 assume !(0 != main_~p2~0); 4288#L57-1 assume !(0 != main_~p3~0); 4277#L61-1 assume !(0 != main_~p4~0); 4279#L65-1 assume !(0 != main_~p5~0); 4269#L69-1 assume !(0 != main_~p6~0); 4270#L73-1 assume !(0 != main_~p7~0); 4243#L77-1 assume !(0 != main_~p1~0); 4244#L83-1 assume !(0 != main_~p2~0); 4306#L88-1 assume !(0 != main_~p3~0); 4303#L93-1 assume !(0 != main_~p4~0); 4301#L98-1 assume !(0 != main_~p5~0); 4299#L103-1 assume !(0 != main_~p6~0); 4297#L108-1 assume !(0 != main_~p7~0); 3988#L113-1 [2021-07-06 19:03:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,835 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-07-06 19:03:57,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991384160] [2021-07-06 19:03:57,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,841 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,845 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,848 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2021-07-06 19:03:57,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807752133] [2021-07-06 19:03:57,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,852 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,854 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,857 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:03:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2021-07-06 19:03:57,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:03:57,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286613480] [2021-07-06 19:03:57,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:03:57,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:03:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,864 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:03:57,869 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:03:57,873 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:03:57,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:57,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-07-06 19:03:58,132 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2021-07-06 19:03:58,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:03:58,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-07-06 19:03:58,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 07:03:58 BoogieIcfgContainer [2021-07-06 19:03:58,224 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 19:03:58,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 19:03:58,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 19:03:58,225 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 19:03:58,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:03:56" (3/4) ... [2021-07-06 19:03:58,227 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 19:03:58,254 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 19:03:58,254 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 19:03:58,255 INFO L168 Benchmark]: Toolchain (without parser) took 2297.81 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 29.8 MB in the beginning and 45.0 MB in the end (delta: -15.2 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,255 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 41.9 MB. Free memory is still 23.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 19:03:58,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.68 ms. Allocated memory is still 56.6 MB. Free memory was 29.6 MB in the beginning and 32.8 MB in the end (delta: -3.2 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,256 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.29 ms. Allocated memory is still 56.6 MB. Free memory was 32.8 MB in the beginning and 39.9 MB in the end (delta: -7.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,256 INFO L168 Benchmark]: Boogie Preprocessor took 45.53 ms. Allocated memory is still 56.6 MB. Free memory was 39.9 MB in the beginning and 38.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,256 INFO L168 Benchmark]: RCFGBuilder took 451.33 ms. Allocated memory is still 56.6 MB. Free memory was 38.7 MB in the beginning and 35.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,257 INFO L168 Benchmark]: BuchiAutomizer took 1491.01 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 35.5 MB in the beginning and 47.0 MB in the end (delta: -11.5 MB). Peak memory consumption was 37.3 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,257 INFO L168 Benchmark]: Witness Printer took 29.37 ms. Allocated memory is still 83.9 MB. Free memory was 47.0 MB in the beginning and 45.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 19:03:58,259 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 41.9 MB. Free memory is still 23.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 233.68 ms. Allocated memory is still 56.6 MB. Free memory was 29.6 MB in the beginning and 32.8 MB in the end (delta: -3.2 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.29 ms. Allocated memory is still 56.6 MB. Free memory was 32.8 MB in the beginning and 39.9 MB in the end (delta: -7.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.53 ms. Allocated memory is still 56.6 MB. Free memory was 39.9 MB in the beginning and 38.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 451.33 ms. Allocated memory is still 56.6 MB. Free memory was 38.7 MB in the beginning and 35.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 1491.01 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 35.5 MB in the beginning and 47.0 MB in the end (delta: -11.5 MB). Peak memory consumption was 37.3 MB. Max. memory is 16.1 GB. * Witness Printer took 29.37 ms. Allocated memory is still 83.9 MB. Free memory was 47.0 MB in the beginning and 45.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. 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 99.9ms AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1282 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 350 SDtfs, 179 SDslu, 208 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 69.7ms 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: 32]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=720} State at position 1 is {NULL=721, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=720, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1657504f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ab84fce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36fb6317=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11fd4c47=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d84b31f=0, cond=11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25da5d5e=0, NULL=722, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48d46129=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33b09300=11, NULL=0, NULL=0, NULL=0, NULL=723, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 19:03:58,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...