./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_10.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_10.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 6423b7e5fbcc52c08e52aff49c79db620dd407c4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:40:47,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:40:47,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:40:47,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:40:47,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:40:47,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:40:47,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:40:47,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:40:47,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:40:47,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:40:47,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:40:47,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:40:47,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:40:47,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:40:47,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:40:47,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:40:47,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:40:47,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:40:47,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:40:47,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:40:47,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:40:47,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:40:47,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:40:47,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:40:47,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:40:47,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:40:47,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:40:47,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:40:47,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:40:47,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:40:47,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:40:47,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:40:47,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:40:47,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:40:47,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:40:47,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:40:47,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:40:47,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:40:47,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:40:47,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:40:47,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:40:47,132 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:40:47,166 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:40:47,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:40:47,167 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:40:47,167 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:40:47,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:40:47,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:40:47,169 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:40:47,169 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:40:47,169 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:40:47,170 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:40:47,170 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:40:47,171 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:40:47,171 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:40:47,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:40:47,171 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 14:40:47,171 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:40:47,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:40:47,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 14:40:47,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:40:47,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:40:47,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:40:47,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:40:47,172 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 14:40:47,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:40:47,173 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:40:47,173 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:40:47,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:40:47,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:40:47,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:40:47,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:40:47,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:40:47,174 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:40:47,175 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:40:47,175 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 -> 6423b7e5fbcc52c08e52aff49c79db620dd407c4 [2021-08-27 14:40:47,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:40:47,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:40:47,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:40:47,508 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:40:47,508 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:40:47,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2021-08-27 14:40:47,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6fa7bfbe/30d72b9ba955477b95b774dee2b8d4c5/FLAG70d8d35eb [2021-08-27 14:40:48,031 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:40:48,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2021-08-27 14:40:48,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6fa7bfbe/30d72b9ba955477b95b774dee2b8d4c5/FLAG70d8d35eb [2021-08-27 14:40:48,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6fa7bfbe/30d72b9ba955477b95b774dee2b8d4c5 [2021-08-27 14:40:48,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:40:48,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:40:48,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:40:48,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:40:48,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:40:48,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:40:48" (1/1) ... [2021-08-27 14:40:48,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f36594b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:48, skipping insertion in model container [2021-08-27 14:40:48,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:40:48" (1/1) ... [2021-08-27 14:40:48,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:40:48,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:40:48,613 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_10.c[3901,3914] [2021-08-27 14:40:48,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:40:48,621 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:40:48,640 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_10.c[3901,3914] [2021-08-27 14:40:48,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:40:48,652 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:40:48,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:48 WrapperNode [2021-08-27 14:40:48,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:40:48,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:40:48,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:40:48,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:40:48,693 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:40:48" (1/1) ... [2021-08-27 14:40:48,707 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:40:48" (1/1) ... [2021-08-27 14:40:48,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:40:48,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:40:48,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:40:48,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:40:48,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:48" (1/1) ... [2021-08-27 14:40:48,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:48" (1/1) ... [2021-08-27 14:40:48,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:48" (1/1) ... [2021-08-27 14:40:48,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:48" (1/1) ... [2021-08-27 14:40:48,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:48" (1/1) ... [2021-08-27 14:40:48,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:48" (1/1) ... [2021-08-27 14:40:48,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:48" (1/1) ... [2021-08-27 14:40:48,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:40:48,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:40:48,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:40:48,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:40:48,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:48" (1/1) ... [2021-08-27 14:40:48,751 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:40:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:40:48,769 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:40:48,782 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:40:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:40:48,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:40:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 14:40:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:40:49,185 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:40:49,186 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-27 14:40:49,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:40:49 BoogieIcfgContainer [2021-08-27 14:40:49,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:40:49,189 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:40:49,189 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:40:49,191 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:40:49,192 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:40:49,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:40:48" (1/3) ... [2021-08-27 14:40:49,193 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@404b59c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:40:49, skipping insertion in model container [2021-08-27 14:40:49,193 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:40:49,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:40:48" (2/3) ... [2021-08-27 14:40:49,194 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@404b59c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:40:49, skipping insertion in model container [2021-08-27 14:40:49,194 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:40:49,194 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:40:49" (3/3) ... [2021-08-27 14:40:49,195 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2021-08-27 14:40:49,247 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:40:49,247 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:40:49,247 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:40:49,247 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:40:49,247 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:40:49,247 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:40:49,248 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:40:49,248 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:40:49,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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:40:49,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-08-27 14:40:49,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:49,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:49,280 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:49,280 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, 1, 1] [2021-08-27 14:40:49,281 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:40:49,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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:40:49,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-08-27 14:40:49,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:49,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:49,285 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:49,285 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, 1, 1] [2021-08-27 14:40:49,291 INFO L791 eck$LassoCheckResult]: Stem: 24#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 9#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_#t~nondet17, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~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;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;havoc main_~cond~0; 30#L155-1true [2021-08-27 14:40:49,292 INFO L793 eck$LassoCheckResult]: Loop: 30#L155-1true assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 27#L43true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 31#L68true assume 0 != main_~p1~0;main_~lk1~0 := 1; 10#L68-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 4#L72-1true assume !(0 != main_~p3~0); 19#L76-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 18#L80-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 32#L84-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 20#L88-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 7#L92-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 5#L96-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 8#L100-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 39#L104-1true assume !(0 != main_~p1~0); 25#L110-1true assume !(0 != main_~p2~0); 34#L115-1true assume !(0 != main_~p3~0); 17#L120-1true assume !(0 != main_~p4~0); 29#L125-1true assume !(0 != main_~p5~0); 36#L130-1true assume !(0 != main_~p6~0); 16#L135-1true assume !(0 != main_~p7~0); 14#L140-1true assume !(0 != main_~p8~0); 40#L145-1true assume !(0 != main_~p9~0); 11#L150-1true assume !(0 != main_~p10~0); 30#L155-1true [2021-08-27 14:40:49,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:49,302 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 14:40:49,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:49,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553523473] [2021-08-27 14:40:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:49,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:49,409 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:49,462 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1693159719, now seen corresponding path program 1 times [2021-08-27 14:40:49,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:49,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254694646] [2021-08-27 14:40:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:49,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:49,540 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:40:49,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:49,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254694646] [2021-08-27 14:40:49,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254694646] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:49,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:49,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:49,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477159976] [2021-08-27 14:40:49,546 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:49,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:49,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:49,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:49,560 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:40:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:49,597 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2021-08-27 14:40:49,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:49,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 130 transitions. [2021-08-27 14:40:49,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2021-08-27 14:40:49,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 65 states and 103 transitions. [2021-08-27 14:40:49,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-08-27 14:40:49,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-08-27 14:40:49,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 103 transitions. [2021-08-27 14:40:49,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:49,610 INFO L681 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2021-08-27 14:40:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 103 transitions. [2021-08-27 14:40:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-08-27 14:40:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 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:40:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2021-08-27 14:40:49,650 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2021-08-27 14:40:49,650 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2021-08-27 14:40:49,651 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:40:49,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 103 transitions. [2021-08-27 14:40:49,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2021-08-27 14:40:49,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:49,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:49,661 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:49,662 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, 1, 1] [2021-08-27 14:40:49,662 INFO L791 eck$LassoCheckResult]: Stem: 150#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 132#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_#t~nondet17, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~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;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;havoc main_~cond~0; 133#L155-1 [2021-08-27 14:40:49,663 INFO L793 eck$LassoCheckResult]: Loop: 133#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 154#L43 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 155#L68 assume !(0 != main_~p1~0); 134#L68-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 123#L72-1 assume !(0 != main_~p3~0); 124#L76-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 145#L80-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 146#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 167#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 166#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 125#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 126#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 131#L104-1 assume !(0 != main_~p1~0); 151#L110-1 assume !(0 != main_~p2~0); 152#L115-1 assume !(0 != main_~p3~0); 144#L120-1 assume !(0 != main_~p4~0); 128#L125-1 assume !(0 != main_~p5~0); 138#L130-1 assume !(0 != main_~p6~0); 143#L135-1 assume !(0 != main_~p7~0); 139#L140-1 assume !(0 != main_~p8~0); 140#L145-1 assume !(0 != main_~p9~0); 135#L150-1 assume !(0 != main_~p10~0); 133#L155-1 [2021-08-27 14:40:49,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:49,664 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 14:40:49,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:49,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853202084] [2021-08-27 14:40:49,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:49,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:49,683 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:49,696 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1784159127, now seen corresponding path program 1 times [2021-08-27 14:40:49,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:49,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336219743] [2021-08-27 14:40:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:49,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:49,724 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:40:49,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:49,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336219743] [2021-08-27 14:40:49,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336219743] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:49,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:49,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:49,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745747401] [2021-08-27 14:40:49,725 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:49,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:49,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:49,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:49,726 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:40:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:49,744 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2021-08-27 14:40:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:49,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 198 transitions. [2021-08-27 14:40:49,747 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2021-08-27 14:40:49,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 198 transitions. [2021-08-27 14:40:49,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-08-27 14:40:49,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-08-27 14:40:49,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 198 transitions. [2021-08-27 14:40:49,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:49,751 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2021-08-27 14:40:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 198 transitions. [2021-08-27 14:40:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-08-27 14:40:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 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:40:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2021-08-27 14:40:49,759 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2021-08-27 14:40:49,759 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2021-08-27 14:40:49,759 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:40:49,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 198 transitions. [2021-08-27 14:40:49,761 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2021-08-27 14:40:49,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:49,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:49,761 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:49,761 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, 1, 1] [2021-08-27 14:40:49,762 INFO L791 eck$LassoCheckResult]: Stem: 347#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 328#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_#t~nondet17, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~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;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;havoc main_~cond~0; 329#L155-1 [2021-08-27 14:40:49,762 INFO L793 eck$LassoCheckResult]: Loop: 329#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 373#L43 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 371#L68 assume !(0 != main_~p1~0); 369#L68-2 assume !(0 != main_~p2~0); 368#L72-1 assume !(0 != main_~p3~0); 367#L76-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 366#L80-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 365#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 364#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 363#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 362#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 361#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 359#L104-1 assume !(0 != main_~p1~0); 360#L110-1 assume !(0 != main_~p2~0); 391#L115-1 assume !(0 != main_~p3~0); 388#L120-1 assume !(0 != main_~p4~0); 385#L125-1 assume !(0 != main_~p5~0); 383#L130-1 assume !(0 != main_~p6~0); 381#L135-1 assume !(0 != main_~p7~0); 379#L140-1 assume !(0 != main_~p8~0); 377#L145-1 assume !(0 != main_~p9~0); 375#L150-1 assume !(0 != main_~p10~0); 329#L155-1 [2021-08-27 14:40:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:49,762 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 14:40:49,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:49,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365970864] [2021-08-27 14:40:49,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:49,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:49,772 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:49,784 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:49,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:49,785 INFO L82 PathProgramCache]: Analyzing trace with hash 95215385, now seen corresponding path program 1 times [2021-08-27 14:40:49,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:49,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548437133] [2021-08-27 14:40:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:49,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:49,811 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:40:49,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:49,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548437133] [2021-08-27 14:40:49,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548437133] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:49,811 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:49,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:49,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654411689] [2021-08-27 14:40:49,812 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:49,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:49,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:49,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:49,813 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. cyclomatic complexity: 76 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:40:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:49,843 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2021-08-27 14:40:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:49,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 382 transitions. [2021-08-27 14:40:49,847 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2021-08-27 14:40:49,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 246 states and 382 transitions. [2021-08-27 14:40:49,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2021-08-27 14:40:49,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2021-08-27 14:40:49,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 382 transitions. [2021-08-27 14:40:49,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:49,851 INFO L681 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2021-08-27 14:40:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 382 transitions. [2021-08-27 14:40:49,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2021-08-27 14:40:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 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:40:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 382 transitions. [2021-08-27 14:40:49,880 INFO L704 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2021-08-27 14:40:49,880 INFO L587 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2021-08-27 14:40:49,880 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:40:49,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 382 transitions. [2021-08-27 14:40:49,882 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2021-08-27 14:40:49,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:49,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:49,882 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:49,882 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, 1, 1] [2021-08-27 14:40:49,883 INFO L791 eck$LassoCheckResult]: Stem: 729#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 706#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_#t~nondet17, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~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;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;havoc main_~cond~0; 707#L155-1 [2021-08-27 14:40:49,883 INFO L793 eck$LassoCheckResult]: Loop: 707#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 776#L43 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 773#L68 assume !(0 != main_~p1~0); 769#L68-2 assume !(0 != main_~p2~0); 767#L72-1 assume !(0 != main_~p3~0); 764#L76-1 assume !(0 != main_~p4~0); 765#L80-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 759#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 760#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 755#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 756#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 751#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 752#L104-1 assume !(0 != main_~p1~0); 807#L110-1 assume !(0 != main_~p2~0); 805#L115-1 assume !(0 != main_~p3~0); 802#L120-1 assume !(0 != main_~p4~0); 799#L125-1 assume !(0 != main_~p5~0); 795#L130-1 assume !(0 != main_~p6~0); 791#L135-1 assume !(0 != main_~p7~0); 787#L140-1 assume !(0 != main_~p8~0); 783#L145-1 assume !(0 != main_~p9~0); 781#L150-1 assume !(0 != main_~p10~0); 707#L155-1 [2021-08-27 14:40:49,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:49,883 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 14:40:49,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:49,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013797527] [2021-08-27 14:40:49,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:49,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:49,892 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:49,902 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1493132517, now seen corresponding path program 1 times [2021-08-27 14:40:49,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:49,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945000751] [2021-08-27 14:40:49,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:49,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:49,960 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:40:49,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:49,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945000751] [2021-08-27 14:40:49,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945000751] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:49,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:49,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:49,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997951142] [2021-08-27 14:40:49,963 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:49,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:49,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:49,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:49,965 INFO L87 Difference]: Start difference. First operand 246 states and 382 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:40:49,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:49,995 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2021-08-27 14:40:49,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:49,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 738 transitions. [2021-08-27 14:40:50,003 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2021-08-27 14:40:50,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 738 transitions. [2021-08-27 14:40:50,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2021-08-27 14:40:50,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2021-08-27 14:40:50,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 738 transitions. [2021-08-27 14:40:50,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:50,024 INFO L681 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2021-08-27 14:40:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 738 transitions. [2021-08-27 14:40:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2021-08-27 14:40:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 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:40:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 738 transitions. [2021-08-27 14:40:50,057 INFO L704 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2021-08-27 14:40:50,060 INFO L587 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2021-08-27 14:40:50,060 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:40:50,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 738 transitions. [2021-08-27 14:40:50,065 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2021-08-27 14:40:50,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:50,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:50,067 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:50,068 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, 1, 1] [2021-08-27 14:40:50,068 INFO L791 eck$LassoCheckResult]: Stem: 1462#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1440#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_#t~nondet17, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~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;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;havoc main_~cond~0; 1441#L155-1 [2021-08-27 14:40:50,069 INFO L793 eck$LassoCheckResult]: Loop: 1441#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 1511#L43 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 1508#L68 assume !(0 != main_~p1~0); 1504#L68-2 assume !(0 != main_~p2~0); 1501#L72-1 assume !(0 != main_~p3~0); 1498#L76-1 assume !(0 != main_~p4~0); 1499#L80-1 assume !(0 != main_~p5~0); 1562#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1559#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1556#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1553#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1551#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1548#L104-1 assume !(0 != main_~p1~0); 1544#L110-1 assume !(0 != main_~p2~0); 1541#L115-1 assume !(0 != main_~p3~0); 1537#L120-1 assume !(0 != main_~p4~0); 1534#L125-1 assume !(0 != main_~p5~0); 1532#L130-1 assume !(0 != main_~p6~0); 1528#L135-1 assume !(0 != main_~p7~0); 1524#L140-1 assume !(0 != main_~p8~0); 1520#L145-1 assume !(0 != main_~p9~0); 1516#L150-1 assume !(0 != main_~p10~0); 1441#L155-1 [2021-08-27 14:40:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,070 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-27 14:40:50,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166770924] [2021-08-27 14:40:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,082 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,103 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:50,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1780766425, now seen corresponding path program 1 times [2021-08-27 14:40:50,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530485705] [2021-08-27 14:40:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:50,150 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:40:50,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:50,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530485705] [2021-08-27 14:40:50,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530485705] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:50,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:50,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:50,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246293367] [2021-08-27 14:40:50,154 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:50,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:50,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:50,158 INFO L87 Difference]: Start difference. First operand 482 states and 738 transitions. cyclomatic complexity: 272 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:40:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:50,179 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2021-08-27 14:40:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:50,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1426 transitions. [2021-08-27 14:40:50,188 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2021-08-27 14:40:50,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1426 transitions. [2021-08-27 14:40:50,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2021-08-27 14:40:50,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2021-08-27 14:40:50,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1426 transitions. [2021-08-27 14:40:50,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:50,196 INFO L681 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2021-08-27 14:40:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1426 transitions. [2021-08-27 14:40:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2021-08-27 14:40:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 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:40:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1426 transitions. [2021-08-27 14:40:50,229 INFO L704 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2021-08-27 14:40:50,229 INFO L587 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2021-08-27 14:40:50,229 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:40:50,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1426 transitions. [2021-08-27 14:40:50,234 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2021-08-27 14:40:50,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:50,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:50,235 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:50,235 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, 1, 1] [2021-08-27 14:40:50,235 INFO L791 eck$LassoCheckResult]: Stem: 2899#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2874#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_#t~nondet17, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~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;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;havoc main_~cond~0; 2875#L155-1 [2021-08-27 14:40:50,236 INFO L793 eck$LassoCheckResult]: Loop: 2875#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 2948#L43 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 2949#L68 assume !(0 != main_~p1~0); 3042#L68-2 assume !(0 != main_~p2~0); 3037#L72-1 assume !(0 != main_~p3~0); 3031#L76-1 assume !(0 != main_~p4~0); 3032#L80-1 assume !(0 != main_~p5~0); 3051#L84-1 assume !(0 != main_~p6~0); 3047#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3045#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3039#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3035#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3028#L104-1 assume !(0 != main_~p1~0); 3001#L110-1 assume !(0 != main_~p2~0); 2998#L115-1 assume !(0 != main_~p3~0); 2993#L120-1 assume !(0 != main_~p4~0); 2989#L125-1 assume !(0 != main_~p5~0); 2987#L130-1 assume !(0 != main_~p6~0); 2972#L135-1 assume !(0 != main_~p7~0); 2971#L140-1 assume !(0 != main_~p8~0); 3067#L145-1 assume !(0 != main_~p9~0); 2956#L150-1 assume !(0 != main_~p10~0); 2875#L155-1 [2021-08-27 14:40:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,236 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-27 14:40:50,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928062226] [2021-08-27 14:40:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,259 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,267 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,268 INFO L82 PathProgramCache]: Analyzing trace with hash 500902747, now seen corresponding path program 1 times [2021-08-27 14:40:50,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475540134] [2021-08-27 14:40:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:50,327 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:40:50,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:50,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475540134] [2021-08-27 14:40:50,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475540134] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:50,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:50,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:50,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623184731] [2021-08-27 14:40:50,329 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:50,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:50,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:50,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:50,330 INFO L87 Difference]: Start difference. First operand 946 states and 1426 transitions. cyclomatic complexity: 512 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:40:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:50,379 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2021-08-27 14:40:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:50,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2754 transitions. [2021-08-27 14:40:50,406 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2021-08-27 14:40:50,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2754 transitions. [2021-08-27 14:40:50,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1858 [2021-08-27 14:40:50,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1858 [2021-08-27 14:40:50,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2754 transitions. [2021-08-27 14:40:50,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:50,464 INFO L681 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2021-08-27 14:40:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2754 transitions. [2021-08-27 14:40:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2021-08-27 14:40:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 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:40:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2754 transitions. [2021-08-27 14:40:50,605 INFO L704 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2021-08-27 14:40:50,606 INFO L587 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2021-08-27 14:40:50,606 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:40:50,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1858 states and 2754 transitions. [2021-08-27 14:40:50,614 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2021-08-27 14:40:50,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:50,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:50,615 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:50,615 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, 1, 1] [2021-08-27 14:40:50,615 INFO L791 eck$LassoCheckResult]: Stem: 5706#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5684#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_#t~nondet17, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~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;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;havoc main_~cond~0; 5685#L155-1 [2021-08-27 14:40:50,616 INFO L793 eck$LassoCheckResult]: Loop: 5685#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 5885#L43 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 5882#L68 assume !(0 != main_~p1~0); 5878#L68-2 assume !(0 != main_~p2~0); 5875#L72-1 assume !(0 != main_~p3~0); 5873#L76-1 assume !(0 != main_~p4~0); 5863#L80-1 assume !(0 != main_~p5~0); 5865#L84-1 assume !(0 != main_~p6~0); 5850#L88-1 assume !(0 != main_~p7~0); 5852#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5838#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5839#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 5825#L104-1 assume !(0 != main_~p1~0); 5826#L110-1 assume !(0 != main_~p2~0); 5804#L115-1 assume !(0 != main_~p3~0); 5803#L120-1 assume !(0 != main_~p4~0); 5903#L125-1 assume !(0 != main_~p5~0); 5901#L130-1 assume !(0 != main_~p6~0); 5899#L135-1 assume !(0 != main_~p7~0); 5896#L140-1 assume !(0 != main_~p8~0); 5894#L145-1 assume !(0 != main_~p9~0); 5890#L150-1 assume !(0 != main_~p10~0); 5685#L155-1 [2021-08-27 14:40:50,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,616 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-27 14:40:50,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855264673] [2021-08-27 14:40:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,624 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,639 INFO L82 PathProgramCache]: Analyzing trace with hash -510214503, now seen corresponding path program 1 times [2021-08-27 14:40:50,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381433401] [2021-08-27 14:40:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:50,672 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:40:50,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:50,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381433401] [2021-08-27 14:40:50,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381433401] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:50,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:50,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:50,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460322591] [2021-08-27 14:40:50,673 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:50,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:50,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:50,675 INFO L87 Difference]: Start difference. First operand 1858 states and 2754 transitions. cyclomatic complexity: 960 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:40:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:50,713 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2021-08-27 14:40:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:50,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 5314 transitions. [2021-08-27 14:40:50,749 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2021-08-27 14:40:50,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 5314 transitions. [2021-08-27 14:40:50,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2021-08-27 14:40:50,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2021-08-27 14:40:50,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 5314 transitions. [2021-08-27 14:40:50,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:50,781 INFO L681 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2021-08-27 14:40:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 5314 transitions. [2021-08-27 14:40:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650. [2021-08-27 14:40:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 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:40:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5314 transitions. [2021-08-27 14:40:50,866 INFO L704 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2021-08-27 14:40:50,866 INFO L587 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2021-08-27 14:40:50,866 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:40:50,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 5314 transitions. [2021-08-27 14:40:50,897 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2021-08-27 14:40:50,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:50,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:50,900 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:50,900 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, 1, 1] [2021-08-27 14:40:50,900 INFO L791 eck$LassoCheckResult]: Stem: 11221#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 11198#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_#t~nondet17, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~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;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;havoc main_~cond~0; 11199#L155-1 [2021-08-27 14:40:50,900 INFO L793 eck$LassoCheckResult]: Loop: 11199#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 11355#L43 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 11352#L68 assume !(0 != main_~p1~0); 11348#L68-2 assume !(0 != main_~p2~0); 11345#L72-1 assume !(0 != main_~p3~0); 11342#L76-1 assume !(0 != main_~p4~0); 11291#L80-1 assume !(0 != main_~p5~0); 11277#L84-1 assume !(0 != main_~p6~0); 11279#L88-1 assume !(0 != main_~p7~0); 11480#L92-1 assume !(0 != main_~p8~0); 11481#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 11482#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 11439#L104-1 assume !(0 != main_~p1~0); 11436#L110-1 assume !(0 != main_~p2~0); 11423#L115-1 assume !(0 != main_~p3~0); 11416#L120-1 assume !(0 != main_~p4~0); 11411#L125-1 assume !(0 != main_~p5~0); 11404#L130-1 assume !(0 != main_~p6~0); 11398#L135-1 assume !(0 != main_~p7~0); 11393#L140-1 assume !(0 != main_~p8~0); 11387#L145-1 assume !(0 != main_~p9~0); 11360#L150-1 assume !(0 != main_~p10~0); 11199#L155-1 [2021-08-27 14:40:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-27 14:40:50,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860942051] [2021-08-27 14:40:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,924 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:50,939 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1097020517, now seen corresponding path program 1 times [2021-08-27 14:40:50,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:50,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591650224] [2021-08-27 14:40:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:50,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:50,969 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:40:50,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:50,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591650224] [2021-08-27 14:40:50,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591650224] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:50,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:50,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:40:50,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668170951] [2021-08-27 14:40:50,971 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:50,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:50,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:50,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:50,972 INFO L87 Difference]: Start difference. First operand 3650 states and 5314 transitions. cyclomatic complexity: 1792 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:40:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:51,009 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2021-08-27 14:40:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:51,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7170 states and 10242 transitions. [2021-08-27 14:40:51,134 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2021-08-27 14:40:51,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7170 states to 7170 states and 10242 transitions. [2021-08-27 14:40:51,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7170 [2021-08-27 14:40:51,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7170 [2021-08-27 14:40:51,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7170 states and 10242 transitions. [2021-08-27 14:40:51,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:51,215 INFO L681 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2021-08-27 14:40:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states and 10242 transitions. [2021-08-27 14:40:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7170. [2021-08-27 14:40:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 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:40:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 10242 transitions. [2021-08-27 14:40:51,373 INFO L704 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2021-08-27 14:40:51,373 INFO L587 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2021-08-27 14:40:51,373 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:40:51,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7170 states and 10242 transitions. [2021-08-27 14:40:51,403 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2021-08-27 14:40:51,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:51,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:51,404 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:51,404 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, 1, 1] [2021-08-27 14:40:51,404 INFO L791 eck$LassoCheckResult]: Stem: 22047#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 22025#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_#t~nondet17, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~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;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;havoc main_~cond~0; 22026#L155-1 [2021-08-27 14:40:51,404 INFO L793 eck$LassoCheckResult]: Loop: 22026#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 22222#L43 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 22212#L68 assume !(0 != main_~p1~0); 22214#L68-2 assume !(0 != main_~p2~0); 22204#L72-1 assume !(0 != main_~p3~0); 22205#L76-1 assume !(0 != main_~p4~0); 22437#L80-1 assume !(0 != main_~p5~0); 22435#L84-1 assume !(0 != main_~p6~0); 22431#L88-1 assume !(0 != main_~p7~0); 22427#L92-1 assume !(0 != main_~p8~0); 22423#L96-1 assume !(0 != main_~p9~0); 22421#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 22417#L104-1 assume !(0 != main_~p1~0); 22413#L110-1 assume !(0 != main_~p2~0); 22409#L115-1 assume !(0 != main_~p3~0); 22406#L120-1 assume !(0 != main_~p4~0); 22401#L125-1 assume !(0 != main_~p5~0); 22402#L130-1 assume !(0 != main_~p6~0); 22391#L135-1 assume !(0 != main_~p7~0); 22392#L140-1 assume !(0 != main_~p8~0); 22228#L145-1 assume !(0 != main_~p9~0); 22229#L150-1 assume !(0 != main_~p10~0); 22026#L155-1 [2021-08-27 14:40:51,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:51,405 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-08-27 14:40:51,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:51,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922806154] [2021-08-27 14:40:51,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:51,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:51,414 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:51,435 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash -838855079, now seen corresponding path program 1 times [2021-08-27 14:40:51,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:51,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309597920] [2021-08-27 14:40:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:51,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:40:51,457 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:40:51,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:40:51,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309597920] [2021-08-27 14:40:51,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309597920] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:40:51,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:40:51,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 14:40:51,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985145892] [2021-08-27 14:40:51,458 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:40:51,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:40:51,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:40:51,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:40:51,465 INFO L87 Difference]: Start difference. First operand 7170 states and 10242 transitions. cyclomatic complexity: 3328 Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:40:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:40:51,549 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2021-08-27 14:40:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:40:51,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14082 states and 19714 transitions. [2021-08-27 14:40:51,657 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2021-08-27 14:40:51,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14082 states to 14082 states and 19714 transitions. [2021-08-27 14:40:51,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14082 [2021-08-27 14:40:51,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14082 [2021-08-27 14:40:51,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14082 states and 19714 transitions. [2021-08-27 14:40:51,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:40:51,765 INFO L681 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2021-08-27 14:40:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states and 19714 transitions. [2021-08-27 14:40:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 14082. [2021-08-27 14:40:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 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:40:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 19714 transitions. [2021-08-27 14:40:52,096 INFO L704 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2021-08-27 14:40:52,096 INFO L587 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2021-08-27 14:40:52,096 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 14:40:52,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14082 states and 19714 transitions. [2021-08-27 14:40:52,147 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2021-08-27 14:40:52,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:40:52,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:40:52,148 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:40:52,148 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, 1, 1] [2021-08-27 14:40:52,149 INFO L791 eck$LassoCheckResult]: Stem: 43305#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 43283#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_#t~nondet17, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~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;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;havoc main_~cond~0; 43284#L155-1 [2021-08-27 14:40:52,149 INFO L793 eck$LassoCheckResult]: Loop: 43284#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 43670#L43 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 43660#L68 assume !(0 != main_~p1~0); 43662#L68-2 assume !(0 != main_~p2~0); 43651#L72-1 assume !(0 != main_~p3~0); 43652#L76-1 assume !(0 != main_~p4~0); 43620#L80-1 assume !(0 != main_~p5~0); 43622#L84-1 assume !(0 != main_~p6~0); 43715#L88-1 assume !(0 != main_~p7~0); 43717#L92-1 assume !(0 != main_~p8~0); 43779#L96-1 assume !(0 != main_~p9~0); 43776#L100-1 assume !(0 != main_~p10~0); 43772#L104-1 assume !(0 != main_~p1~0); 43768#L110-1 assume !(0 != main_~p2~0); 43765#L115-1 assume !(0 != main_~p3~0); 43761#L120-1 assume !(0 != main_~p4~0); 43444#L125-1 assume !(0 != main_~p5~0); 43445#L130-1 assume !(0 != main_~p6~0); 43434#L135-1 assume !(0 != main_~p7~0); 43436#L140-1 assume !(0 != main_~p8~0); 43679#L145-1 assume !(0 != main_~p9~0); 43681#L150-1 assume !(0 != main_~p10~0); 43284#L155-1 [2021-08-27 14:40:52,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:52,150 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-08-27 14:40:52,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:52,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570351381] [2021-08-27 14:40:52,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:52,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,164 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,175 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:52,177 INFO L82 PathProgramCache]: Analyzing trace with hash -137790501, now seen corresponding path program 1 times [2021-08-27 14:40:52,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:52,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351842330] [2021-08-27 14:40:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:52,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,186 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,195 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:40:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash -970235363, now seen corresponding path program 1 times [2021-08-27 14:40:52,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:40:52,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252033272] [2021-08-27 14:40:52,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:40:52,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:40:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,207 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:40:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:40:52,222 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:40:52,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:40:52 BoogieIcfgContainer [2021-08-27 14:40:52,948 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:40:52,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:40:52,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:40:52,949 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:40:52,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:40:49" (3/4) ... [2021-08-27 14:40:52,952 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 14:40:52,999 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 14:40:53,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:40:53,001 INFO L168 Benchmark]: Toolchain (without parser) took 4565.15 ms. Allocated memory was 62.9 MB in the beginning and 662.7 MB in the end (delta: 599.8 MB). Free memory was 43.7 MB in the beginning and 574.9 MB in the end (delta: -531.2 MB). Peak memory consumption was 68.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,001 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 62.9 MB. Free memory is still 45.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:40:53,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.01 ms. Allocated memory is still 62.9 MB. Free memory was 43.5 MB in the beginning and 33.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.34 ms. Allocated memory is still 62.9 MB. Free memory was 33.2 MB in the beginning and 46.1 MB in the end (delta: -12.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,002 INFO L168 Benchmark]: Boogie Preprocessor took 18.68 ms. Allocated memory is still 62.9 MB. Free memory was 46.1 MB in the beginning and 44.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,003 INFO L168 Benchmark]: RCFGBuilder took 443.76 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 44.7 MB in the beginning and 55.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,003 INFO L168 Benchmark]: BuchiAutomizer took 3759.36 ms. Allocated memory was 75.5 MB in the beginning and 662.7 MB in the end (delta: 587.2 MB). Free memory was 55.3 MB in the beginning and 576.9 MB in the end (delta: -521.7 MB). Peak memory consumption was 136.9 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,003 INFO L168 Benchmark]: Witness Printer took 51.15 ms. Allocated memory is still 662.7 MB. Free memory was 576.9 MB in the beginning and 574.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:40:53,005 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.21 ms. Allocated memory is still 62.9 MB. Free memory is still 45.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 215.01 ms. Allocated memory is still 62.9 MB. Free memory was 43.5 MB in the beginning and 33.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.34 ms. Allocated memory is still 62.9 MB. Free memory was 33.2 MB in the beginning and 46.1 MB in the end (delta: -12.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 18.68 ms. Allocated memory is still 62.9 MB. Free memory was 46.1 MB in the beginning and 44.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 443.76 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 44.7 MB in the beginning and 55.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3759.36 ms. Allocated memory was 75.5 MB in the beginning and 662.7 MB in the end (delta: 587.2 MB). Free memory was 55.3 MB in the beginning and 576.9 MB in the end (delta: -521.7 MB). Peak memory consumption was 136.9 MB. Max. memory is 16.1 GB. * Witness Printer took 51.15 ms. Allocated memory is still 662.7 MB. Free memory was 576.9 MB in the beginning and 574.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14082 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 842.8ms AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 14082 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 722 SDtfs, 374 SDslu, 445 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 94.9ms Time LassoAnalysisResults: nont1 unkn0 SFLI9 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: 41]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=11453} State at position 1 is {NULL=11454, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=11453, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@715b9b32=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ed4ba3d=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1308bfb3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e309ffb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@339f0504=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d08aa26=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67dcf678=9, cond=9, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28814418=0, NULL=11456, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e22839c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64f714e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f0b9a5b=0, NULL=0, NULL=0, NULL=0, NULL=11455, 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: 41]: 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; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 14:40:53,064 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...