./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_7.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:29:58,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:29:58,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:29:58,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:29:58,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:29:58,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:29:58,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:29:58,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:29:58,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:29:58,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:29:58,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:29:58,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:29:58,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:29:58,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:29:58,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:29:58,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:29:58,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:29:58,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:29:58,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:29:58,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:29:58,401 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:29:58,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:29:58,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:29:58,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:29:58,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:29:58,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:29:58,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:29:58,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:29:58,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:29:58,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:29:58,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:29:58,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:29:58,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:29:58,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:29:58,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:29:58,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:29:58,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:29:58,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:29:58,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:29:58,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:29:58,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:29:58,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:29:58,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:29:58,440 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:29:58,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:29:58,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:29:58,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:29:58,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:29:58,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:29:58,442 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:29:58,442 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:29:58,443 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:29:58,443 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:29:58,443 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:29:58,443 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:29:58,444 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:29:58,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:29:58,444 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:29:58,444 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:29:58,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:29:58,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:29:58,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:29:58,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:29:58,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:29:58,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:29:58,446 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:29:58,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:29:58,446 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:29:58,446 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:29:58,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:29:58,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:29:58,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:29:58,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:29:58,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:29:58,447 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:29:58,448 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2022-07-13 03:29:58,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:29:58,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:29:58,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:29:58,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:29:58,637 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:29:58,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2022-07-13 03:29:58,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f57b9f488/040dda5982c74d5e8505ffa757d50c7a/FLAG7144e2807 [2022-07-13 03:29:59,043 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:29:59,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2022-07-13 03:29:59,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f57b9f488/040dda5982c74d5e8505ffa757d50c7a/FLAG7144e2807 [2022-07-13 03:29:59,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f57b9f488/040dda5982c74d5e8505ffa757d50c7a [2022-07-13 03:29:59,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:29:59,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:29:59,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:29:59,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:29:59,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:29:59,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660734f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59, skipping insertion in model container [2022-07-13 03:29:59,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:29:59,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:29:59,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2022-07-13 03:29:59,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:29:59,626 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:29:59,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2022-07-13 03:29:59,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:29:59,651 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:29:59,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59 WrapperNode [2022-07-13 03:29:59,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:29:59,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:29:59,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:29:59,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:29:59,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,678 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2022-07-13 03:29:59,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:29:59,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:29:59,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:29:59,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:29:59,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:29:59,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:29:59,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:29:59,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:29:59,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59" (1/1) ... [2022-07-13 03:29:59,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:29:59,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:29:59,745 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) [2022-07-13 03:29:59,763 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 [2022-07-13 03:29:59,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:29:59,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:29:59,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:29:59,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:29:59,824 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:29:59,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:29:59,935 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:29:59,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:29:59,940 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 03:29:59,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:59 BoogieIcfgContainer [2022-07-13 03:29:59,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:29:59,942 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:29:59,942 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:29:59,945 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:29:59,946 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:59,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:29:59" (1/3) ... [2022-07-13 03:29:59,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4454c1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:29:59, skipping insertion in model container [2022-07-13 03:29:59,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:59,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:59" (2/3) ... [2022-07-13 03:29:59,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4454c1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:29:59, skipping insertion in model container [2022-07-13 03:29:59,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:59,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:59" (3/3) ... [2022-07-13 03:29:59,950 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2022-07-13 03:29:59,982 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:29:59,982 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:29:59,982 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:29:59,982 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:29:59,982 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:29:59,982 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:29:59,982 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:29:59,983 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:29:59,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:59,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-13 03:29:59,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:59,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:59,999 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:59,999 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:00,000 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:30:00,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-13 03:30:00,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:00,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:00,003 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:00,003 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:00,008 INFO L752 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 17#L113-1true [2022-07-13 03:30:00,009 INFO L754 eck$LassoCheckResult]: Loop: 17#L113-1true assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 28#L34true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 29#L53true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L53-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L57-1true assume !(0 != main_~p3~0#1); 9#L61-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 25#L65-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 27#L69-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L73-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 24#L77-1true assume !(0 != main_~p1~0#1); 30#L83-1true assume !(0 != main_~p2~0#1); 14#L88-1true assume !(0 != main_~p3~0#1); 10#L93-1true assume !(0 != main_~p4~0#1); 15#L98-1true assume !(0 != main_~p5~0#1); 7#L103-1true assume !(0 != main_~p6~0#1); 13#L108-1true assume !(0 != main_~p7~0#1); 17#L113-1true [2022-07-13 03:30:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,014 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:30:00,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976974743] [2022-07-13 03:30:00,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,085 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2022-07-13 03:30:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870201541] [2022-07-13 03:30:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:00,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870201541] [2022-07-13 03:30:00,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870201541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:00,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:00,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355224801] [2022-07-13 03:30:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:00,161 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:00,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:00,182 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:00,200 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2022-07-13 03:30:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:00,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 94 transitions. [2022-07-13 03:30:00,206 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2022-07-13 03:30:00,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 73 transitions. [2022-07-13 03:30:00,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-07-13 03:30:00,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-07-13 03:30:00,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2022-07-13 03:30:00,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:00,212 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2022-07-13 03:30:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2022-07-13 03:30:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-13 03:30:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2022-07-13 03:30:00,230 INFO L392 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2022-07-13 03:30:00,230 INFO L374 stractBuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2022-07-13 03:30:00,230 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:30:00,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2022-07-13 03:30:00,232 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2022-07-13 03:30:00,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:00,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:00,232 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:00,232 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:00,232 INFO L752 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 100#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 101#L113-1 [2022-07-13 03:30:00,232 INFO L754 eck$LassoCheckResult]: Loop: 101#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 116#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 121#L53 assume !(0 != main_~p1~0#1); 123#L53-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 142#L57-1 assume !(0 != main_~p3~0#1); 141#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 140#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 139#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 138#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 137#L77-1 assume !(0 != main_~p1~0#1); 136#L83-1 assume !(0 != main_~p2~0#1); 134#L88-1 assume !(0 != main_~p3~0#1); 132#L93-1 assume !(0 != main_~p4~0#1); 129#L98-1 assume !(0 != main_~p5~0#1); 104#L103-1 assume !(0 != main_~p6~0#1); 106#L108-1 assume !(0 != main_~p7~0#1); 101#L113-1 [2022-07-13 03:30:00,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 03:30:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25424519] [2022-07-13 03:30:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2022-07-13 03:30:00,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652312245] [2022-07-13 03:30:00,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:00,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:00,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652312245] [2022-07-13 03:30:00,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652312245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:00,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:00,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642265215] [2022-07-13 03:30:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:00,293 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:00,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:00,293 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:00,308 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2022-07-13 03:30:00,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:00,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2022-07-13 03:30:00,311 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2022-07-13 03:30:00,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2022-07-13 03:30:00,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2022-07-13 03:30:00,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2022-07-13 03:30:00,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2022-07-13 03:30:00,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:00,314 INFO L369 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2022-07-13 03:30:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2022-07-13 03:30:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-13 03:30:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2022-07-13 03:30:00,319 INFO L392 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2022-07-13 03:30:00,319 INFO L374 stractBuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2022-07-13 03:30:00,319 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:30:00,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2022-07-13 03:30:00,320 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2022-07-13 03:30:00,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:00,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:00,321 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:00,321 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:00,332 INFO L752 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 243#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 244#L113-1 [2022-07-13 03:30:00,335 INFO L754 eck$LassoCheckResult]: Loop: 244#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 305#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 287#L53 assume !(0 != main_~p1~0#1); 289#L53-2 assume !(0 != main_~p2~0#1); 255#L57-1 assume !(0 != main_~p3~0#1); 250#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 251#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 269#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 293#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 292#L77-1 assume !(0 != main_~p1~0#1); 273#L83-1 assume !(0 != main_~p2~0#1); 274#L88-1 assume !(0 != main_~p3~0#1); 320#L93-1 assume !(0 != main_~p4~0#1); 317#L98-1 assume !(0 != main_~p5~0#1); 315#L103-1 assume !(0 != main_~p6~0#1); 311#L108-1 assume !(0 != main_~p7~0#1); 244#L113-1 [2022-07-13 03:30:00,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-13 03:30:00,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706308992] [2022-07-13 03:30:00,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,341 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2022-07-13 03:30:00,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085422823] [2022-07-13 03:30:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:00,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:00,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085422823] [2022-07-13 03:30:00,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085422823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:00,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:00,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:00,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204295041] [2022-07-13 03:30:00,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:00,375 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:00,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:00,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:00,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:00,376 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:00,388 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2022-07-13 03:30:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:00,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2022-07-13 03:30:00,396 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2022-07-13 03:30:00,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2022-07-13 03:30:00,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-07-13 03:30:00,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-07-13 03:30:00,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2022-07-13 03:30:00,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:00,399 INFO L369 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2022-07-13 03:30:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2022-07-13 03:30:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-07-13 03:30:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2022-07-13 03:30:00,407 INFO L392 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2022-07-13 03:30:00,407 INFO L374 stractBuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2022-07-13 03:30:00,407 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:30:00,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2022-07-13 03:30:00,409 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2022-07-13 03:30:00,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:00,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:00,409 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:00,409 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:00,409 INFO L752 eck$LassoCheckResult]: Stem: 536#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 513#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 514#L113-1 [2022-07-13 03:30:00,409 INFO L754 eck$LassoCheckResult]: Loop: 514#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 575#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 558#L53 assume !(0 != main_~p1~0#1); 559#L53-2 assume !(0 != main_~p2~0#1); 632#L57-1 assume !(0 != main_~p3~0#1); 629#L61-1 assume !(0 != main_~p4~0#1); 627#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 625#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 623#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 621#L77-1 assume !(0 != main_~p1~0#1); 618#L83-1 assume !(0 != main_~p2~0#1); 615#L88-1 assume !(0 != main_~p3~0#1); 612#L93-1 assume !(0 != main_~p4~0#1); 608#L98-1 assume !(0 != main_~p5~0#1); 605#L103-1 assume !(0 != main_~p6~0#1); 580#L108-1 assume !(0 != main_~p7~0#1); 514#L113-1 [2022-07-13 03:30:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,410 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-13 03:30:00,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745121145] [2022-07-13 03:30:00,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2022-07-13 03:30:00,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951065456] [2022-07-13 03:30:00,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:00,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:00,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951065456] [2022-07-13 03:30:00,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951065456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:00,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:00,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:00,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312363802] [2022-07-13 03:30:00,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:00,443 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:00,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:00,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:00,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:00,444 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:00,462 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2022-07-13 03:30:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:00,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2022-07-13 03:30:00,465 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2022-07-13 03:30:00,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2022-07-13 03:30:00,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2022-07-13 03:30:00,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2022-07-13 03:30:00,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2022-07-13 03:30:00,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:00,469 INFO L369 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2022-07-13 03:30:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2022-07-13 03:30:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2022-07-13 03:30:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2022-07-13 03:30:00,494 INFO L392 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2022-07-13 03:30:00,494 INFO L374 stractBuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2022-07-13 03:30:00,494 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:30:00,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2022-07-13 03:30:00,495 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2022-07-13 03:30:00,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:00,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:00,496 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:00,496 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:00,496 INFO L752 eck$LassoCheckResult]: Stem: 1055#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1031#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 1032#L113-1 [2022-07-13 03:30:00,497 INFO L754 eck$LassoCheckResult]: Loop: 1032#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1129#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 1114#L53 assume !(0 != main_~p1~0#1); 1116#L53-2 assume !(0 != main_~p2~0#1); 1096#L57-1 assume !(0 != main_~p3~0#1); 1097#L61-1 assume !(0 != main_~p4~0#1); 1168#L65-1 assume !(0 != main_~p5~0#1); 1167#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1166#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1164#L77-1 assume !(0 != main_~p1~0#1); 1160#L83-1 assume !(0 != main_~p2~0#1); 1157#L88-1 assume !(0 != main_~p3~0#1); 1153#L93-1 assume !(0 != main_~p4~0#1); 1154#L98-1 assume !(0 != main_~p5~0#1); 1145#L103-1 assume !(0 != main_~p6~0#1); 1144#L108-1 assume !(0 != main_~p7~0#1); 1032#L113-1 [2022-07-13 03:30:00,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,497 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-13 03:30:00,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907083465] [2022-07-13 03:30:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,507 INFO L85 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2022-07-13 03:30:00,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819444078] [2022-07-13 03:30:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:00,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:00,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819444078] [2022-07-13 03:30:00,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819444078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:00,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:00,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:00,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945474963] [2022-07-13 03:30:00,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:00,530 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:00,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:00,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:00,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:00,531 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:00,552 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2022-07-13 03:30:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:00,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2022-07-13 03:30:00,557 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2022-07-13 03:30:00,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2022-07-13 03:30:00,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2022-07-13 03:30:00,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2022-07-13 03:30:00,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2022-07-13 03:30:00,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:00,564 INFO L369 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2022-07-13 03:30:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2022-07-13 03:30:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2022-07-13 03:30:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2022-07-13 03:30:00,598 INFO L392 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2022-07-13 03:30:00,598 INFO L374 stractBuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2022-07-13 03:30:00,598 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:30:00,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2022-07-13 03:30:00,601 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2022-07-13 03:30:00,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:00,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:00,601 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:00,601 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:00,601 INFO L752 eck$LassoCheckResult]: Stem: 2056#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 2033#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 2034#L113-1 [2022-07-13 03:30:00,601 INFO L754 eck$LassoCheckResult]: Loop: 2034#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2163#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 2159#L53 assume !(0 != main_~p1~0#1); 2157#L53-2 assume !(0 != main_~p2~0#1); 2154#L57-1 assume !(0 != main_~p3~0#1); 2150#L61-1 assume !(0 != main_~p4~0#1); 2147#L65-1 assume !(0 != main_~p5~0#1); 2148#L69-1 assume !(0 != main_~p6~0#1); 2139#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2140#L77-1 assume !(0 != main_~p1~0#1); 2128#L83-1 assume !(0 != main_~p2~0#1); 2130#L88-1 assume !(0 != main_~p3~0#1); 2118#L93-1 assume !(0 != main_~p4~0#1); 2119#L98-1 assume !(0 != main_~p5~0#1); 2172#L103-1 assume !(0 != main_~p6~0#1); 2169#L108-1 assume !(0 != main_~p7~0#1); 2034#L113-1 [2022-07-13 03:30:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,605 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-13 03:30:00,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4933938] [2022-07-13 03:30:00,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,612 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2022-07-13 03:30:00,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327509170] [2022-07-13 03:30:00,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:00,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:00,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327509170] [2022-07-13 03:30:00,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327509170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:00,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:00,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:30:00,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957451291] [2022-07-13 03:30:00,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:00,651 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:00,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:00,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:00,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:00,652 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:00,665 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2022-07-13 03:30:00,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:00,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2022-07-13 03:30:00,675 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2022-07-13 03:30:00,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2022-07-13 03:30:00,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2022-07-13 03:30:00,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2022-07-13 03:30:00,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2022-07-13 03:30:00,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:00,684 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2022-07-13 03:30:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2022-07-13 03:30:00,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2022-07-13 03:30:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2022-07-13 03:30:00,712 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2022-07-13 03:30:00,712 INFO L374 stractBuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2022-07-13 03:30:00,713 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:30:00,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2022-07-13 03:30:00,718 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2022-07-13 03:30:00,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:00,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:00,719 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:00,719 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:00,719 INFO L752 eck$LassoCheckResult]: Stem: 4003#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 3979#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 3980#L113-1 [2022-07-13 03:30:00,719 INFO L754 eck$LassoCheckResult]: Loop: 3980#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 4339#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 4336#L53 assume !(0 != main_~p1~0#1); 4332#L53-2 assume !(0 != main_~p2~0#1); 4329#L57-1 assume !(0 != main_~p3~0#1); 4326#L61-1 assume !(0 != main_~p4~0#1); 4322#L65-1 assume !(0 != main_~p5~0#1); 4323#L69-1 assume !(0 != main_~p6~0#1); 4367#L73-1 assume !(0 != main_~p7~0#1); 4361#L77-1 assume !(0 != main_~p1~0#1); 4356#L83-1 assume !(0 != main_~p2~0#1); 4352#L88-1 assume !(0 != main_~p3~0#1); 4348#L93-1 assume !(0 != main_~p4~0#1); 4346#L98-1 assume !(0 != main_~p5~0#1); 4345#L103-1 assume !(0 != main_~p6~0#1); 4343#L108-1 assume !(0 != main_~p7~0#1); 3980#L113-1 [2022-07-13 03:30:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-07-13 03:30:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789809646] [2022-07-13 03:30:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,728 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,732 INFO L85 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2022-07-13 03:30:00,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201924434] [2022-07-13 03:30:00,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,735 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2022-07-13 03:30:00,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195243014] [2022-07-13 03:30:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:30:00 BoogieIcfgContainer [2022-07-13 03:30:00,973 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:30:00,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:30:00,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:30:00,974 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:30:00,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:59" (3/4) ... [2022-07-13 03:30:00,976 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 03:30:01,012 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 03:30:01,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:30:01,019 INFO L158 Benchmark]: Toolchain (without parser) took 1538.83ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 66.9MB in the beginning and 88.6MB in the end (delta: -21.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-07-13 03:30:01,019 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 75.5MB. Free memory was 33.9MB in the beginning and 33.9MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:30:01,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.70ms. Allocated memory is still 100.7MB. Free memory was 66.5MB in the beginning and 75.3MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:30:01,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.79ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 73.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:01,021 INFO L158 Benchmark]: Boogie Preprocessor took 15.68ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 72.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:01,021 INFO L158 Benchmark]: RCFGBuilder took 245.20ms. Allocated memory is still 100.7MB. Free memory was 72.6MB in the beginning and 62.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:30:01,021 INFO L158 Benchmark]: BuchiAutomizer took 1031.09ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 62.2MB in the beginning and 90.7MB in the end (delta: -28.5MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-07-13 03:30:01,022 INFO L158 Benchmark]: Witness Printer took 44.86ms. Allocated memory is still 132.1MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:01,024 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.14ms. Allocated memory is still 75.5MB. Free memory was 33.9MB in the beginning and 33.9MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.70ms. Allocated memory is still 100.7MB. Free memory was 66.5MB in the beginning and 75.3MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.79ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 73.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.68ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 72.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 245.20ms. Allocated memory is still 100.7MB. Free memory was 72.6MB in the beginning and 62.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1031.09ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 62.2MB in the beginning and 90.7MB in the end (delta: -28.5MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Witness Printer took 44.86ms. Allocated memory is still 132.1MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 558 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 350 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 32]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {lk5=0, p1=0, NULL=0, NULL=1, cond=4, p5=0, lk2=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f83df45=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@285ed3e2=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49f915ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e54f704=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42219f6=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15b9f2a4=0, \result=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19cd694=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15e582f8=4, p2=0, lk4=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-13 03:30:01,094 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)