./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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_9.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 20a70402cc893fb2c7adec21ca8a267adc3c5cbb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 14:41:15,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:41:15,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:41:15,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:41:15,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:41:15,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:41:15,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:41:15,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:41:15,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:41:15,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:41:15,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:41:15,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:41:15,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:41:15,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:41:15,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:41:15,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:41:15,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:41:15,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:41:15,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:41:15,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:41:15,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:41:15,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:41:15,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:41:15,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:41:15,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:41:15,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:41:15,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:41:15,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:41:15,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:41:15,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:41:15,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:41:15,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:41:15,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:41:15,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:41:15,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:41:15,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:41:15,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:41:15,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:41:15,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:41:15,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:41:15,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:41:15,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 14:41:15,789 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:41:15,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:41:15,790 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:41:15,791 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:41:15,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:41:15,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:41:15,793 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:41:15,793 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:41:15,793 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:41:15,793 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:41:15,794 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:41:15,794 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:41:15,795 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:41:15,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:41:15,795 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 14:41:15,795 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:41:15,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:41:15,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 14:41:15,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:41:15,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:41:15,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:41:15,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:41:15,796 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 14:41:15,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:41:15,797 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:41:15,797 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:41:15,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:41:15,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:41:15,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:41:15,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:41:15,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:41:15,798 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:41:15,800 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:41:15,800 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 -> 20a70402cc893fb2c7adec21ca8a267adc3c5cbb [2021-08-27 14:41:16,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:41:16,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:41:16,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:41:16,180 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:41:16,182 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:41:16,184 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2021-08-27 14:41:16,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691bb9b5b/b9358aebb6ae4e18afac24f9c583bcf3/FLAGb631d87f3 [2021-08-27 14:41:16,711 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:41:16,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2021-08-27 14:41:16,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691bb9b5b/b9358aebb6ae4e18afac24f9c583bcf3/FLAGb631d87f3 [2021-08-27 14:41:17,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691bb9b5b/b9358aebb6ae4e18afac24f9c583bcf3 [2021-08-27 14:41:17,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:41:17,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:41:17,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:41:17,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:41:17,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:41:17,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416f4437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17, skipping insertion in model container [2021-08-27 14:41:17,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:41:17,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:41:17,374 WARN L228 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_9.c[3555,3568] [2021-08-27 14:41:17,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:41:17,384 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:41:17,405 WARN L228 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_9.c[3555,3568] [2021-08-27 14:41:17,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:41:17,423 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:41:17,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17 WrapperNode [2021-08-27 14:41:17,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:41:17,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:41:17,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:41:17,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:41:17,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:41:17,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:41:17,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:41:17,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:41:17,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:41:17,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:41:17,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:41:17,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:41:17,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17" (1/1) ... [2021-08-27 14:41:17,520 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:41:17,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:41:17,550 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-08-27 14:41:17,579 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-08-27 14:41:17,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:41:17,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:41:17,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 14:41:17,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:41:17,975 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:41:17,976 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-27 14:41:17,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:41:17 BoogieIcfgContainer [2021-08-27 14:41:17,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:41:17,979 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:41:17,979 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:41:17,983 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:41:17,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:41:17,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:41:17" (1/3) ... [2021-08-27 14:41:17,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e05c904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:41:17, skipping insertion in model container [2021-08-27 14:41:17,985 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:41:17,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:17" (2/3) ... [2021-08-27 14:41:17,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e05c904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:41:17, skipping insertion in model container [2021-08-27 14:41:17,985 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:41:17,986 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:41:17" (3/3) ... [2021-08-27 14:41:17,987 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2021-08-27 14:41:18,033 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:41:18,033 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:41:18,033 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:41:18,034 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:41:18,034 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:41:18,034 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:41:18,034 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:41:18,034 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:41:18,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 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-08-27 14:41:18,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2021-08-27 14:41:18,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:18,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:18,070 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:18,070 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:18,071 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:41:18,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 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-08-27 14:41:18,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2021-08-27 14:41:18,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:18,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:18,078 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:18,078 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:18,084 INFO L791 eck$LassoCheckResult]: Stem: 19#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); 8#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;havoc main_~cond~0; 14#L141-1true [2021-08-27 14:41:18,088 INFO L793 eck$LassoCheckResult]: Loop: 14#L141-1true assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 36#L40true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0; 4#L63true assume 0 != main_~p1~0;main_~lk1~0 := 1; 21#L63-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 28#L67-1true assume !(0 != main_~p3~0); 25#L71-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 29#L75-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 15#L79-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 37#L83-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 10#L87-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 5#L91-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 34#L95-1true assume !(0 != main_~p1~0); 23#L101-1true assume !(0 != main_~p2~0); 11#L106-1true assume !(0 != main_~p3~0); 12#L111-1true assume !(0 != main_~p4~0); 33#L116-1true assume !(0 != main_~p5~0); 6#L121-1true assume !(0 != main_~p6~0); 18#L126-1true assume !(0 != main_~p7~0); 30#L131-1true assume !(0 != main_~p8~0); 20#L136-1true assume !(0 != main_~p9~0); 14#L141-1true [2021-08-27 14:41:18,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:18,095 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 14:41:18,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:18,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48872833] [2021-08-27 14:41:18,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:18,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:18,194 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:18,241 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:18,246 INFO L82 PathProgramCache]: Analyzing trace with hash 694706197, now seen corresponding path program 1 times [2021-08-27 14:41:18,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:18,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160725029] [2021-08-27 14:41:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:18,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:18,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:18,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160725029] [2021-08-27 14:41:18,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160725029] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:18,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:18,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:18,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379885331] [2021-08-27 14:41:18,347 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:18,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:18,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:18,364 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 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 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08-27 14:41:18,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:18,411 INFO L93 Difference]: Finished difference Result 69 states and 118 transitions. [2021-08-27 14:41:18,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:18,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 118 transitions. [2021-08-27 14:41:18,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2021-08-27 14:41:18,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 59 states and 93 transitions. [2021-08-27 14:41:18,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2021-08-27 14:41:18,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2021-08-27 14:41:18,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 93 transitions. [2021-08-27 14:41:18,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:18,433 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2021-08-27 14:41:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 93 transitions. [2021-08-27 14:41:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-08-27 14:41:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.576271186440678) internal successors, (93), 58 states have internal predecessors, (93), 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-08-27 14:41:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 93 transitions. [2021-08-27 14:41:18,459 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2021-08-27 14:41:18,459 INFO L587 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2021-08-27 14:41:18,459 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:41:18,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 93 transitions. [2021-08-27 14:41:18,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2021-08-27 14:41:18,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:18,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:18,461 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:18,465 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:18,465 INFO L791 eck$LassoCheckResult]: Stem: 138#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); 123#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;havoc main_~cond~0; 124#L141-1 [2021-08-27 14:41:18,465 INFO L793 eck$LassoCheckResult]: Loop: 124#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 131#L40 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0; 158#L63 assume !(0 != main_~p1~0); 157#L63-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 146#L67-1 assume !(0 != main_~p3~0); 147#L71-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 148#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 132#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 133#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 125#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 116#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 117#L95-1 assume !(0 != main_~p1~0); 142#L101-1 assume !(0 != main_~p2~0); 126#L106-1 assume !(0 != main_~p3~0); 127#L111-1 assume !(0 != main_~p4~0); 122#L116-1 assume !(0 != main_~p5~0); 118#L121-1 assume !(0 != main_~p6~0); 120#L126-1 assume !(0 != main_~p7~0); 162#L131-1 assume !(0 != main_~p8~0); 139#L136-1 assume !(0 != main_~p9~0); 124#L141-1 [2021-08-27 14:41:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:18,466 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 14:41:18,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:18,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198810535] [2021-08-27 14:41:18,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:18,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:18,490 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:18,504 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:18,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1299438509, now seen corresponding path program 1 times [2021-08-27 14:41:18,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:18,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434211716] [2021-08-27 14:41:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:18,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:18,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:18,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434211716] [2021-08-27 14:41:18,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434211716] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:18,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:18,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:18,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997388359] [2021-08-27 14:41:18,549 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:18,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:18,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:18,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:18,552 INFO L87 Difference]: Start difference. First operand 59 states and 93 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08-27 14:41:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:18,571 INFO L93 Difference]: Finished difference Result 114 states and 178 transitions. [2021-08-27 14:41:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:18,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 178 transitions. [2021-08-27 14:41:18,574 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2021-08-27 14:41:18,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 178 transitions. [2021-08-27 14:41:18,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2021-08-27 14:41:18,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2021-08-27 14:41:18,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 178 transitions. [2021-08-27 14:41:18,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:18,577 INFO L681 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2021-08-27 14:41:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 178 transitions. [2021-08-27 14:41:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-08-27 14:41:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.5614035087719298) internal successors, (178), 113 states have internal predecessors, (178), 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-08-27 14:41:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2021-08-27 14:41:18,585 INFO L704 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2021-08-27 14:41:18,585 INFO L587 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2021-08-27 14:41:18,585 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:41:18,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 178 transitions. [2021-08-27 14:41:18,587 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2021-08-27 14:41:18,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:18,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:18,588 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:18,588 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:18,588 INFO L791 eck$LassoCheckResult]: Stem: 321#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); 302#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;havoc main_~cond~0; 303#L141-1 [2021-08-27 14:41:18,588 INFO L793 eck$LassoCheckResult]: Loop: 303#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 339#L40 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0; 336#L63 assume !(0 != main_~p1~0); 337#L63-2 assume !(0 != main_~p2~0); 379#L67-1 assume !(0 != main_~p3~0); 378#L71-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 377#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 376#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 375#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 374#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 373#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 372#L95-1 assume !(0 != main_~p1~0); 371#L101-1 assume !(0 != main_~p2~0); 368#L106-1 assume !(0 != main_~p3~0); 363#L111-1 assume !(0 != main_~p4~0); 360#L116-1 assume !(0 != main_~p5~0); 356#L121-1 assume !(0 != main_~p6~0); 352#L126-1 assume !(0 != main_~p7~0); 348#L131-1 assume !(0 != main_~p8~0); 344#L136-1 assume !(0 != main_~p9~0); 303#L141-1 [2021-08-27 14:41:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 14:41:18,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:18,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956690080] [2021-08-27 14:41:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:18,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:18,600 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:18,609 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:18,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:18,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1407180885, now seen corresponding path program 1 times [2021-08-27 14:41:18,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:18,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092219637] [2021-08-27 14:41:18,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:18,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:18,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:18,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092219637] [2021-08-27 14:41:18,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092219637] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:18,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:18,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:18,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970423458] [2021-08-27 14:41:18,634 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:18,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:18,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:18,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:18,635 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. cyclomatic complexity: 68 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08-27 14:41:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:18,675 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2021-08-27 14:41:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:18,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 342 transitions. [2021-08-27 14:41:18,681 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2021-08-27 14:41:18,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 342 transitions. [2021-08-27 14:41:18,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2021-08-27 14:41:18,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2021-08-27 14:41:18,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 342 transitions. [2021-08-27 14:41:18,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:18,684 INFO L681 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2021-08-27 14:41:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 342 transitions. [2021-08-27 14:41:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2021-08-27 14:41:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 222 states have (on average 1.5405405405405406) internal successors, (342), 221 states have internal predecessors, (342), 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-08-27 14:41:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2021-08-27 14:41:18,695 INFO L704 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2021-08-27 14:41:18,695 INFO L587 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2021-08-27 14:41:18,695 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:41:18,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 342 transitions. [2021-08-27 14:41:18,697 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2021-08-27 14:41:18,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:18,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:18,698 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:18,698 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:18,698 INFO L791 eck$LassoCheckResult]: Stem: 662#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); 644#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;havoc main_~cond~0; 645#L141-1 [2021-08-27 14:41:18,698 INFO L793 eck$LassoCheckResult]: Loop: 645#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 709#L40 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0; 706#L63 assume !(0 != main_~p1~0); 703#L63-2 assume !(0 != main_~p2~0); 701#L67-1 assume !(0 != main_~p3~0); 698#L71-1 assume !(0 != main_~p4~0); 696#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 694#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 692#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 690#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 688#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 685#L95-1 assume !(0 != main_~p1~0); 686#L101-1 assume !(0 != main_~p2~0); 734#L106-1 assume !(0 != main_~p3~0); 729#L111-1 assume !(0 != main_~p4~0); 728#L116-1 assume !(0 != main_~p5~0); 724#L121-1 assume !(0 != main_~p6~0); 720#L126-1 assume !(0 != main_~p7~0); 716#L131-1 assume !(0 != main_~p8~0); 713#L136-1 assume !(0 != main_~p9~0); 645#L141-1 [2021-08-27 14:41:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:18,699 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 14:41:18,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:18,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427059859] [2021-08-27 14:41:18,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:18,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:18,707 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:18,716 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:18,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash 127317207, now seen corresponding path program 1 times [2021-08-27 14:41:18,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:18,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831308348] [2021-08-27 14:41:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:18,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:18,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:18,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831308348] [2021-08-27 14:41:18,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831308348] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:18,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:18,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:18,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953566353] [2021-08-27 14:41:18,749 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:18,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:18,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:18,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:18,750 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. cyclomatic complexity: 128 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08-27 14:41:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:18,791 INFO L93 Difference]: Finished difference Result 434 states and 658 transitions. [2021-08-27 14:41:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:18,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 658 transitions. [2021-08-27 14:41:18,798 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2021-08-27 14:41:18,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 658 transitions. [2021-08-27 14:41:18,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2021-08-27 14:41:18,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2021-08-27 14:41:18,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 658 transitions. [2021-08-27 14:41:18,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:18,812 INFO L681 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2021-08-27 14:41:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 658 transitions. [2021-08-27 14:41:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2021-08-27 14:41:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 434 states have (on average 1.5161290322580645) internal successors, (658), 433 states have internal predecessors, (658), 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-08-27 14:41:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 658 transitions. [2021-08-27 14:41:18,832 INFO L704 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2021-08-27 14:41:18,832 INFO L587 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2021-08-27 14:41:18,833 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:41:18,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 658 transitions. [2021-08-27 14:41:18,835 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2021-08-27 14:41:18,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:18,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:18,836 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:18,836 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:18,836 INFO L791 eck$LassoCheckResult]: Stem: 1324#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); 1306#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;havoc main_~cond~0; 1307#L141-1 [2021-08-27 14:41:18,836 INFO L793 eck$LassoCheckResult]: Loop: 1307#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 1355#L40 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0; 1356#L63 assume !(0 != main_~p1~0); 1456#L63-2 assume !(0 != main_~p2~0); 1455#L67-1 assume !(0 != main_~p3~0); 1449#L71-1 assume !(0 != main_~p4~0); 1443#L75-1 assume !(0 != main_~p5~0); 1439#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1435#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1431#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1427#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1404#L95-1 assume !(0 != main_~p1~0); 1405#L101-1 assume !(0 != main_~p2~0); 1418#L106-1 assume !(0 != main_~p3~0); 1414#L111-1 assume !(0 != main_~p4~0); 1411#L116-1 assume !(0 != main_~p5~0); 1412#L121-1 assume !(0 != main_~p6~0); 1469#L126-1 assume !(0 != main_~p7~0); 1379#L131-1 assume !(0 != main_~p8~0); 1378#L136-1 assume !(0 != main_~p9~0); 1307#L141-1 [2021-08-27 14:41:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-27 14:41:18,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:18,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141208519] [2021-08-27 14:41:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:18,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:18,844 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:18,853 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:18,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:18,854 INFO L82 PathProgramCache]: Analyzing trace with hash -883800043, now seen corresponding path program 1 times [2021-08-27 14:41:18,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:18,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606635359] [2021-08-27 14:41:18,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:18,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:18,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:18,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606635359] [2021-08-27 14:41:18,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606635359] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:18,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:18,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:18,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694643581] [2021-08-27 14:41:18,884 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:18,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:18,885 INFO L87 Difference]: Start difference. First operand 434 states and 658 transitions. cyclomatic complexity: 240 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08-27 14:41:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:18,912 INFO L93 Difference]: Finished difference Result 850 states and 1266 transitions. [2021-08-27 14:41:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:18,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 1266 transitions. [2021-08-27 14:41:18,921 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2021-08-27 14:41:18,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 850 states and 1266 transitions. [2021-08-27 14:41:18,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 850 [2021-08-27 14:41:18,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 850 [2021-08-27 14:41:18,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1266 transitions. [2021-08-27 14:41:18,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:18,953 INFO L681 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2021-08-27 14:41:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1266 transitions. [2021-08-27 14:41:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2021-08-27 14:41:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 850 states have (on average 1.4894117647058824) internal successors, (1266), 849 states have internal predecessors, (1266), 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-08-27 14:41:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1266 transitions. [2021-08-27 14:41:19,017 INFO L704 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2021-08-27 14:41:19,018 INFO L587 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2021-08-27 14:41:19,018 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:41:19,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1266 transitions. [2021-08-27 14:41:19,024 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2021-08-27 14:41:19,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:19,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:19,024 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:19,024 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:19,025 INFO L791 eck$LassoCheckResult]: Stem: 2614#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); 2595#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;havoc main_~cond~0; 2596#L141-1 [2021-08-27 14:41:19,025 INFO L793 eck$LassoCheckResult]: Loop: 2596#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 2768#L40 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0; 2766#L63 assume !(0 != main_~p1~0); 2762#L63-2 assume !(0 != main_~p2~0); 2763#L67-1 assume !(0 != main_~p3~0); 2746#L71-1 assume !(0 != main_~p4~0); 2748#L75-1 assume !(0 != main_~p5~0); 2735#L79-1 assume !(0 != main_~p6~0); 2736#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2723#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2724#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2706#L95-1 assume !(0 != main_~p1~0); 2707#L101-1 assume !(0 != main_~p2~0); 2789#L106-1 assume !(0 != main_~p3~0); 2786#L111-1 assume !(0 != main_~p4~0); 2784#L116-1 assume !(0 != main_~p5~0); 2782#L121-1 assume !(0 != main_~p6~0); 2781#L126-1 assume !(0 != main_~p7~0); 2777#L131-1 assume !(0 != main_~p8~0); 2773#L136-1 assume !(0 != main_~p9~0); 2596#L141-1 [2021-08-27 14:41:19,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:19,025 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-27 14:41:19,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:19,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006329936] [2021-08-27 14:41:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:19,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:19,034 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:19,054 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:19,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1470606057, now seen corresponding path program 1 times [2021-08-27 14:41:19,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:19,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736024873] [2021-08-27 14:41:19,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:19,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:19,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-08-27 14:41:19,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:19,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736024873] [2021-08-27 14:41:19,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736024873] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:19,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:19,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:19,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628244185] [2021-08-27 14:41:19,098 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:19,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:19,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:19,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:19,099 INFO L87 Difference]: Start difference. First operand 850 states and 1266 transitions. cyclomatic complexity: 448 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08-27 14:41:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:19,127 INFO L93 Difference]: Finished difference Result 1666 states and 2434 transitions. [2021-08-27 14:41:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:19,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1666 states and 2434 transitions. [2021-08-27 14:41:19,162 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2021-08-27 14:41:19,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1666 states to 1666 states and 2434 transitions. [2021-08-27 14:41:19,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1666 [2021-08-27 14:41:19,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1666 [2021-08-27 14:41:19,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1666 states and 2434 transitions. [2021-08-27 14:41:19,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:19,179 INFO L681 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2021-08-27 14:41:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states and 2434 transitions. [2021-08-27 14:41:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2021-08-27 14:41:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1666 states have (on average 1.460984393757503) internal successors, (2434), 1665 states have internal predecessors, (2434), 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-08-27 14:41:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2434 transitions. [2021-08-27 14:41:19,231 INFO L704 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2021-08-27 14:41:19,231 INFO L587 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2021-08-27 14:41:19,231 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:41:19,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1666 states and 2434 transitions. [2021-08-27 14:41:19,241 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2021-08-27 14:41:19,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:19,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:19,242 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:19,242 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:19,242 INFO L791 eck$LassoCheckResult]: Stem: 5137#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); 5117#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;havoc main_~cond~0; 5118#L141-1 [2021-08-27 14:41:19,243 INFO L793 eck$LassoCheckResult]: Loop: 5118#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 5213#L40 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0; 5210#L63 assume !(0 != main_~p1~0); 5207#L63-2 assume !(0 != main_~p2~0); 5204#L67-1 assume !(0 != main_~p3~0); 5200#L71-1 assume !(0 != main_~p4~0); 5196#L75-1 assume !(0 != main_~p5~0); 5192#L79-1 assume !(0 != main_~p6~0); 5189#L83-1 assume !(0 != main_~p7~0); 5187#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5185#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5182#L95-1 assume !(0 != main_~p1~0); 5183#L101-1 assume !(0 != main_~p2~0); 5240#L106-1 assume !(0 != main_~p3~0); 5235#L111-1 assume !(0 != main_~p4~0); 5231#L116-1 assume !(0 != main_~p5~0); 5227#L121-1 assume !(0 != main_~p6~0); 5223#L126-1 assume !(0 != main_~p7~0); 5220#L131-1 assume !(0 != main_~p8~0); 5217#L136-1 assume !(0 != main_~p9~0); 5118#L141-1 [2021-08-27 14:41:19,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-27 14:41:19,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:19,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657137490] [2021-08-27 14:41:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:19,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:19,268 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:19,276 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:19,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:19,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1212440619, now seen corresponding path program 1 times [2021-08-27 14:41:19,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:19,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855701633] [2021-08-27 14:41:19,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:19,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:19,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:19,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855701633] [2021-08-27 14:41:19,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855701633] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:19,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:19,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:19,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215616684] [2021-08-27 14:41:19,322 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:19,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:19,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:19,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:19,323 INFO L87 Difference]: Start difference. First operand 1666 states and 2434 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08-27 14:41:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:19,359 INFO L93 Difference]: Finished difference Result 3266 states and 4674 transitions. [2021-08-27 14:41:19,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:19,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3266 states and 4674 transitions. [2021-08-27 14:41:19,382 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2021-08-27 14:41:19,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3266 states to 3266 states and 4674 transitions. [2021-08-27 14:41:19,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3266 [2021-08-27 14:41:19,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3266 [2021-08-27 14:41:19,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3266 states and 4674 transitions. [2021-08-27 14:41:19,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:19,406 INFO L681 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2021-08-27 14:41:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states and 4674 transitions. [2021-08-27 14:41:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2021-08-27 14:41:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3266 states have (on average 1.4311083894672383) internal successors, (4674), 3265 states have internal predecessors, (4674), 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-08-27 14:41:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4674 transitions. [2021-08-27 14:41:19,495 INFO L704 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2021-08-27 14:41:19,495 INFO L587 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2021-08-27 14:41:19,495 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:41:19,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3266 states and 4674 transitions. [2021-08-27 14:41:19,513 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2021-08-27 14:41:19,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:19,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:19,514 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:19,514 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:19,515 INFO L791 eck$LassoCheckResult]: Stem: 10073#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); 10055#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;havoc main_~cond~0; 10056#L141-1 [2021-08-27 14:41:19,515 INFO L793 eck$LassoCheckResult]: Loop: 10056#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 10243#L40 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0; 10240#L63 assume !(0 != main_~p1~0); 10241#L63-2 assume !(0 != main_~p2~0); 10224#L67-1 assume !(0 != main_~p3~0); 10225#L71-1 assume !(0 != main_~p4~0); 10208#L75-1 assume !(0 != main_~p5~0); 10210#L79-1 assume !(0 != main_~p6~0); 10184#L83-1 assume !(0 != main_~p7~0); 10186#L87-1 assume !(0 != main_~p8~0); 10164#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 10165#L95-1 assume !(0 != main_~p1~0); 10268#L101-1 assume !(0 != main_~p2~0); 10267#L106-1 assume !(0 != main_~p3~0); 10264#L111-1 assume !(0 != main_~p4~0); 10262#L116-1 assume !(0 != main_~p5~0); 10258#L121-1 assume !(0 != main_~p6~0); 10254#L126-1 assume !(0 != main_~p7~0); 10250#L131-1 assume !(0 != main_~p8~0); 10247#L136-1 assume !(0 != main_~p9~0); 10056#L141-1 [2021-08-27 14:41:19,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-27 14:41:19,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:19,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30334300] [2021-08-27 14:41:19,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:19,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:19,537 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:19,555 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:19,556 INFO L82 PathProgramCache]: Analyzing trace with hash -511376041, now seen corresponding path program 1 times [2021-08-27 14:41:19,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:19,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100757943] [2021-08-27 14:41:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:19,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:19,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:19,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100757943] [2021-08-27 14:41:19,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100757943] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:19,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:19,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 14:41:19,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216747651] [2021-08-27 14:41:19,585 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:19,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:19,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:19,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:19,586 INFO L87 Difference]: Start difference. First operand 3266 states and 4674 transitions. cyclomatic complexity: 1536 Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08-27 14:41:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:19,645 INFO L93 Difference]: Finished difference Result 6402 states and 8962 transitions. [2021-08-27 14:41:19,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:19,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6402 states and 8962 transitions. [2021-08-27 14:41:19,688 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2021-08-27 14:41:19,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6402 states to 6402 states and 8962 transitions. [2021-08-27 14:41:19,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6402 [2021-08-27 14:41:19,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6402 [2021-08-27 14:41:19,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6402 states and 8962 transitions. [2021-08-27 14:41:19,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:19,784 INFO L681 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2021-08-27 14:41:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states and 8962 transitions. [2021-08-27 14:41:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6402. [2021-08-27 14:41:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6402 states, 6402 states have (on average 1.3998750390502968) internal successors, (8962), 6401 states have internal predecessors, (8962), 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-08-27 14:41:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 8962 transitions. [2021-08-27 14:41:19,995 INFO L704 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2021-08-27 14:41:19,995 INFO L587 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2021-08-27 14:41:19,995 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:41:19,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6402 states and 8962 transitions. [2021-08-27 14:41:20,024 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2021-08-27 14:41:20,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:20,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:20,026 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:20,026 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:20,026 INFO L791 eck$LassoCheckResult]: Stem: 19746#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); 19729#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;havoc main_~cond~0; 19730#L141-1 [2021-08-27 14:41:20,026 INFO L793 eck$LassoCheckResult]: Loop: 19730#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 20273#L40 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0; 20270#L63 assume !(0 != main_~p1~0); 20271#L63-2 assume !(0 != main_~p2~0); 20256#L67-1 assume !(0 != main_~p3~0); 20253#L71-1 assume !(0 != main_~p4~0); 20247#L75-1 assume !(0 != main_~p5~0); 20237#L79-1 assume !(0 != main_~p6~0); 20239#L83-1 assume !(0 != main_~p7~0); 20298#L87-1 assume !(0 != main_~p8~0); 20211#L91-1 assume !(0 != main_~p9~0); 20213#L95-1 assume !(0 != main_~p1~0); 20272#L101-1 assume !(0 != main_~p2~0); 20338#L106-1 assume !(0 != main_~p3~0); 20334#L111-1 assume !(0 != main_~p4~0); 20331#L116-1 assume !(0 != main_~p5~0); 20328#L121-1 assume !(0 != main_~p6~0); 20326#L126-1 assume !(0 != main_~p7~0); 20324#L131-1 assume !(0 != main_~p8~0); 20322#L136-1 assume !(0 != main_~p9~0); 19730#L141-1 [2021-08-27 14:41:20,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:20,027 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-08-27 14:41:20,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:20,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730890124] [2021-08-27 14:41:20,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:20,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:20,041 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:20,049 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:20,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash -904403051, now seen corresponding path program 1 times [2021-08-27 14:41:20,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:20,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279675875] [2021-08-27 14:41:20,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:20,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:20,055 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:20,061 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:20,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash 551712343, now seen corresponding path program 1 times [2021-08-27 14:41:20,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:20,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672893613] [2021-08-27 14:41:20,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:20,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:20,069 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:20,079 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:20,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:41:20 BoogieIcfgContainer [2021-08-27 14:41:20,851 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:41:20,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:41:20,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:41:20,852 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:41:20,853 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:41:17" (3/4) ... [2021-08-27 14:41:20,855 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 14:41:20,905 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 14:41:20,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:41:20,911 INFO L168 Benchmark]: Toolchain (without parser) took 3695.72 ms. Allocated memory was 54.5 MB in the beginning and 249.6 MB in the end (delta: 195.0 MB). Free memory was 31.5 MB in the beginning and 136.3 MB in the end (delta: -104.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:20,911 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.7 MB in the end (delta: 45.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:41:20,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.98 ms. Allocated memory was 54.5 MB in the beginning and 71.3 MB in the end (delta: 16.8 MB). Free memory was 31.3 MB in the beginning and 54.4 MB in the end (delta: -23.1 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:20,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.42 ms. Allocated memory is still 71.3 MB. Free memory was 54.2 MB in the beginning and 52.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:41:20,912 INFO L168 Benchmark]: Boogie Preprocessor took 44.96 ms. Allocated memory is still 71.3 MB. Free memory was 52.6 MB in the beginning and 51.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:20,913 INFO L168 Benchmark]: RCFGBuilder took 466.07 ms. Allocated memory is still 71.3 MB. Free memory was 51.4 MB in the beginning and 48.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 16.2 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:20,913 INFO L168 Benchmark]: BuchiAutomizer took 2872.30 ms. Allocated memory was 71.3 MB in the beginning and 249.6 MB in the end (delta: 178.3 MB). Free memory was 47.8 MB in the beginning and 138.4 MB in the end (delta: -90.6 MB). Peak memory consumption was 88.7 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:20,913 INFO L168 Benchmark]: Witness Printer took 57.67 ms. Allocated memory is still 249.6 MB. Free memory was 138.4 MB in the beginning and 136.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:20,915 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.20 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.7 MB in the end (delta: 45.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 208.98 ms. Allocated memory was 54.5 MB in the beginning and 71.3 MB in the end (delta: 16.8 MB). Free memory was 31.3 MB in the beginning and 54.4 MB in the end (delta: -23.1 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.42 ms. Allocated memory is still 71.3 MB. Free memory was 54.2 MB in the beginning and 52.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.96 ms. Allocated memory is still 71.3 MB. Free memory was 52.6 MB in the beginning and 51.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 466.07 ms. Allocated memory is still 71.3 MB. Free memory was 51.4 MB in the beginning and 48.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 16.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2872.30 ms. Allocated memory was 71.3 MB in the beginning and 249.6 MB in the end (delta: 178.3 MB). Free memory was 47.8 MB in the beginning and 138.4 MB in the end (delta: -90.6 MB). Peak memory consumption was 88.7 MB. Max. memory is 16.1 GB. * Witness Printer took 57.67 ms. Allocated memory is still 249.6 MB. Free memory was 138.4 MB in the beginning and 136.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6402 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 469.8ms AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 6402 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 583 SDtfs, 301 SDslu, 356 SDs, 0 SdLazy, 40 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 111.5ms Time LassoAnalysisResults: nont1 unkn0 SFLI8 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 38]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=28255} State at position 1 is {NULL=28258, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=28255, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1db3d1ea=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4117b285=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60b547c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a67741c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4958c03b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a2a9926=9, cond=9, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35a7d00f=0, NULL=28257, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f661a3c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ed04658=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10606a1=0, NULL=0, NULL=0, NULL=0, NULL=28256, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 38]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 14:41:20,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...