./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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_6.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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:07:01,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:07:01,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:07:01,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:07:01,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:07:01,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:07:01,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:07:01,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:07:01,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:07:01,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:07:01,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:07:01,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:07:01,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:07:01,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:07:01,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:07:01,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:07:01,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:07:01,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:07:01,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:07:01,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:07:01,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:07:01,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:07:01,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:07:01,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:07:01,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:07:01,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:07:01,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:07:01,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:07:01,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:07:01,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:07:01,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:07:01,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:07:01,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:07:01,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:07:01,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:07:01,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:07:01,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:07:01,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:07:01,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:07:01,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:07:01,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:07:01,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:07:01,698 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:07:01,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:07:01,699 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:07:01,699 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:07:01,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:07:01,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:07:01,701 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:07:01,701 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:07:01,701 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:07:01,701 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:07:01,702 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:07:01,703 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:07:01,703 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:07:01,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:07:01,703 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:07:01,703 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:07:01,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:07:01,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:07:01,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:07:01,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:07:01,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:07:01,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:07:01,705 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:07:01,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:07:01,705 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:07:01,705 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:07:01,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:07:01,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:07:01,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:07:01,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:07:01,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:07:01,707 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:07:01,707 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:07:01,707 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2021-12-15 17:07:01,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:07:01,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:07:01,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:07:01,965 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:07:01,965 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:07:01,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2021-12-15 17:07:02,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832d4c47b/6d943fc0d685485885cf6f3aac8d2a71/FLAG10380fb41 [2021-12-15 17:07:02,419 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:07:02,423 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2021-12-15 17:07:02,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832d4c47b/6d943fc0d685485885cf6f3aac8d2a71/FLAG10380fb41 [2021-12-15 17:07:02,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832d4c47b/6d943fc0d685485885cf6f3aac8d2a71 [2021-12-15 17:07:02,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:07:02,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:07:02,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:07:02,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:07:02,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:07:02,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:07:02" (1/1) ... [2021-12-15 17:07:02,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15266fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:02, skipping insertion in model container [2021-12-15 17:07:02,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:07:02" (1/1) ... [2021-12-15 17:07:02,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:07:02,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:07:02,968 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_6.c[2544,2557] [2021-12-15 17:07:02,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:07:02,977 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:07:03,019 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_6.c[2544,2557] [2021-12-15 17:07:03,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:07:03,031 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:07:03,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03 WrapperNode [2021-12-15 17:07:03,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:07:03,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:07:03,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:07:03,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:07:03,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03" (1/1) ... [2021-12-15 17:07:03,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03" (1/1) ... [2021-12-15 17:07:03,058 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 87 [2021-12-15 17:07:03,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:07:03,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:07:03,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:07:03,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:07:03,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03" (1/1) ... [2021-12-15 17:07:03,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03" (1/1) ... [2021-12-15 17:07:03,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03" (1/1) ... [2021-12-15 17:07:03,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03" (1/1) ... [2021-12-15 17:07:03,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03" (1/1) ... [2021-12-15 17:07:03,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03" (1/1) ... [2021-12-15 17:07:03,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03" (1/1) ... [2021-12-15 17:07:03,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:07:03,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:07:03,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:07:03,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:07:03,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03" (1/1) ... [2021-12-15 17:07:03,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:07:03,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:07:03,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:07:03,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:07:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:07:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:07:03,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:07:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:07:03,209 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:07:03,211 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:07:03,311 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:07:03,317 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:07:03,317 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:07:03,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:07:03 BoogieIcfgContainer [2021-12-15 17:07:03,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:07:03,320 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:07:03,320 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:07:03,323 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:07:03,324 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:07:03,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:07:02" (1/3) ... [2021-12-15 17:07:03,325 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aed22f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:07:03, skipping insertion in model container [2021-12-15 17:07:03,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:07:03,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:07:03" (2/3) ... [2021-12-15 17:07:03,326 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aed22f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:07:03, skipping insertion in model container [2021-12-15 17:07:03,326 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:07:03,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:07:03" (3/3) ... [2021-12-15 17:07:03,327 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2021-12-15 17:07:03,377 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:07:03,390 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:07:03,391 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:07:03,391 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:07:03,391 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:07:03,391 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:07:03,392 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:07:03,392 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:07:03,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:03,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-15 17:07:03,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:03,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:03,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:03,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:03,463 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:07:03,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:03,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-15 17:07:03,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:03,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:03,478 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:03,479 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:03,485 INFO L791 eck$LassoCheckResult]: Stem: 17#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); 9#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_~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_~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;havoc main_~cond~0#1; 12#L99-1true [2021-12-15 17:07:03,486 INFO L793 eck$LassoCheckResult]: Loop: 12#L99-1true assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 8#L31true 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; 15#L48true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 4#L48-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 28#L52-1true assume !(0 != main_~p3~0#1); 21#L56-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L60-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 25#L64-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 24#L68-1true assume !(0 != main_~p1~0#1); 27#L74-1true assume !(0 != main_~p2~0#1); 13#L79-1true assume !(0 != main_~p3~0#1); 23#L84-1true assume !(0 != main_~p4~0#1); 14#L89-1true assume !(0 != main_~p5~0#1); 11#L94-1true assume !(0 != main_~p6~0#1); 12#L99-1true [2021-12-15 17:07:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:03,497 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:07:03,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:03,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778223810] [2021-12-15 17:07:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:03,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:03,589 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:03,629 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:03,632 INFO L85 PathProgramCache]: Analyzing trace with hash -11500681, now seen corresponding path program 1 times [2021-12-15 17:07:03,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:03,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180653265] [2021-12-15 17:07:03,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:03,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:03,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:03,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180653265] [2021-12-15 17:07:03,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180653265] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:03,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:03,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:03,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048318561] [2021-12-15 17:07:03,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:03,733 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:03,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:03,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:03,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:03,770 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 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 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:03,810 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2021-12-15 17:07:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:03,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 82 transitions. [2021-12-15 17:07:03,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-15 17:07:03,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 41 states and 63 transitions. [2021-12-15 17:07:03,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-12-15 17:07:03,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-12-15 17:07:03,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2021-12-15 17:07:03,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:03,836 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-12-15 17:07:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2021-12-15 17:07:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-12-15 17:07:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2021-12-15 17:07:03,863 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-12-15 17:07:03,863 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-12-15 17:07:03,864 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:07:03,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2021-12-15 17:07:03,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-15 17:07:03,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:03,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:03,869 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:03,869 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:03,869 INFO L791 eck$LassoCheckResult]: Stem: 89#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); 90#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_~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_~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;havoc main_~cond~0#1; 104#L99-1 [2021-12-15 17:07:03,869 INFO L793 eck$LassoCheckResult]: Loop: 104#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 119#L31 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; 118#L48 assume !(0 != main_~p1~0#1); 87#L48-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 88#L52-1 assume !(0 != main_~p3~0#1); 117#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 116#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 115#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 114#L68-1 assume !(0 != main_~p1~0#1); 111#L74-1 assume !(0 != main_~p2~0#1); 109#L79-1 assume !(0 != main_~p3~0#1); 92#L84-1 assume !(0 != main_~p4~0#1); 123#L89-1 assume !(0 != main_~p5~0#1); 121#L94-1 assume !(0 != main_~p6~0#1); 104#L99-1 [2021-12-15 17:07:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-15 17:07:03,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:03,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126889090] [2021-12-15 17:07:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:03,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:03,894 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:03,899 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash 246664757, now seen corresponding path program 1 times [2021-12-15 17:07:03,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:03,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494842550] [2021-12-15 17:07:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:03,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:03,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:03,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494842550] [2021-12-15 17:07:03,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494842550] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:03,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:03,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:03,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504034135] [2021-12-15 17:07:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:03,936 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:03,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:03,937 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:03,953 INFO L93 Difference]: Finished difference Result 78 states and 118 transitions. [2021-12-15 17:07:03,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:03,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 118 transitions. [2021-12-15 17:07:03,956 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2021-12-15 17:07:03,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 118 transitions. [2021-12-15 17:07:03,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2021-12-15 17:07:03,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2021-12-15 17:07:03,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 118 transitions. [2021-12-15 17:07:03,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:03,959 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-12-15 17:07:03,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 118 transitions. [2021-12-15 17:07:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-15 17:07:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 77 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2021-12-15 17:07:03,964 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-12-15 17:07:03,965 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-12-15 17:07:03,965 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:07:03,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 118 transitions. [2021-12-15 17:07:03,966 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2021-12-15 17:07:03,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:03,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:03,967 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:03,967 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:03,967 INFO L791 eck$LassoCheckResult]: Stem: 214#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); 215#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_~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_~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;havoc main_~cond~0#1; 227#L99-1 [2021-12-15 17:07:03,967 INFO L793 eck$LassoCheckResult]: Loop: 227#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 263#L31 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; 259#L48 assume !(0 != main_~p1~0#1); 258#L48-2 assume !(0 != main_~p2~0#1); 257#L52-1 assume !(0 != main_~p3~0#1); 255#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 253#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 251#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 249#L68-1 assume !(0 != main_~p1~0#1); 240#L74-1 assume !(0 != main_~p2~0#1); 238#L79-1 assume !(0 != main_~p3~0#1); 217#L84-1 assume !(0 != main_~p4~0#1); 276#L89-1 assume !(0 != main_~p5~0#1); 272#L94-1 assume !(0 != main_~p6~0#1); 227#L99-1 [2021-12-15 17:07:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-15 17:07:03,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:03,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888943525] [2021-12-15 17:07:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:03,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:03,977 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:03,991 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:03,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash 947729335, now seen corresponding path program 1 times [2021-12-15 17:07:03,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:03,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781354317] [2021-12-15 17:07:03,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:03,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:04,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:04,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781354317] [2021-12-15 17:07:04,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781354317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:04,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:04,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:04,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979671059] [2021-12-15 17:07:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:04,031 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:04,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:04,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:04,033 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:04,057 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2021-12-15 17:07:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:04,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 222 transitions. [2021-12-15 17:07:04,060 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2021-12-15 17:07:04,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 222 transitions. [2021-12-15 17:07:04,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2021-12-15 17:07:04,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2021-12-15 17:07:04,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 222 transitions. [2021-12-15 17:07:04,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:04,064 INFO L681 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-12-15 17:07:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 222 transitions. [2021-12-15 17:07:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-15 17:07:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.48) internal successors, (222), 149 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2021-12-15 17:07:04,074 INFO L704 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-12-15 17:07:04,075 INFO L587 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-12-15 17:07:04,075 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:07:04,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 222 transitions. [2021-12-15 17:07:04,077 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2021-12-15 17:07:04,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:04,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:04,077 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:04,078 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:04,078 INFO L791 eck$LassoCheckResult]: Stem: 448#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); 449#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_~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_~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;havoc main_~cond~0#1; 461#L99-1 [2021-12-15 17:07:04,078 INFO L793 eck$LassoCheckResult]: Loop: 461#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 503#L31 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; 498#L48 assume !(0 != main_~p1~0#1); 492#L48-2 assume !(0 != main_~p2~0#1); 485#L52-1 assume !(0 != main_~p3~0#1); 486#L56-1 assume !(0 != main_~p4~0#1); 546#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 545#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 539#L68-1 assume !(0 != main_~p1~0#1); 541#L74-1 assume !(0 != main_~p2~0#1); 538#L79-1 assume !(0 != main_~p3~0#1); 536#L84-1 assume !(0 != main_~p4~0#1); 535#L89-1 assume !(0 != main_~p5~0#1); 517#L94-1 assume !(0 != main_~p6~0#1); 461#L99-1 [2021-12-15 17:07:04,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-15 17:07:04,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921017819] [2021-12-15 17:07:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,087 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,103 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1627787705, now seen corresponding path program 1 times [2021-12-15 17:07:04,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156527121] [2021-12-15 17:07:04,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:04,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:04,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156527121] [2021-12-15 17:07:04,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156527121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:04,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:04,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:04,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698890335] [2021-12-15 17:07:04,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:04,132 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:04,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:04,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:04,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:04,134 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:04,153 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2021-12-15 17:07:04,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:04,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 418 transitions. [2021-12-15 17:07:04,158 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2021-12-15 17:07:04,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 418 transitions. [2021-12-15 17:07:04,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2021-12-15 17:07:04,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2021-12-15 17:07:04,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 418 transitions. [2021-12-15 17:07:04,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:04,164 INFO L681 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-12-15 17:07:04,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 418 transitions. [2021-12-15 17:07:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2021-12-15 17:07:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 290 states have (on average 1.4413793103448276) internal successors, (418), 289 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 418 transitions. [2021-12-15 17:07:04,182 INFO L704 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-12-15 17:07:04,182 INFO L587 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-12-15 17:07:04,183 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:07:04,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 418 transitions. [2021-12-15 17:07:04,188 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2021-12-15 17:07:04,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:04,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:04,190 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:04,190 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:04,190 INFO L791 eck$LassoCheckResult]: Stem: 894#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); 895#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_~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_~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;havoc main_~cond~0#1; 907#L99-1 [2021-12-15 17:07:04,190 INFO L793 eck$LassoCheckResult]: Loop: 907#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 955#L31 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; 953#L48 assume !(0 != main_~p1~0#1); 949#L48-2 assume !(0 != main_~p2~0#1); 947#L52-1 assume !(0 != main_~p3~0#1); 943#L56-1 assume !(0 != main_~p4~0#1); 939#L60-1 assume !(0 != main_~p5~0#1); 937#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 934#L68-1 assume !(0 != main_~p1~0#1); 935#L74-1 assume !(0 != main_~p2~0#1); 971#L79-1 assume !(0 != main_~p3~0#1); 966#L84-1 assume !(0 != main_~p4~0#1); 962#L89-1 assume !(0 != main_~p5~0#1); 959#L94-1 assume !(0 != main_~p6~0#1); 907#L99-1 [2021-12-15 17:07:04,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-15 17:07:04,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366280973] [2021-12-15 17:07:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,197 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,206 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:04,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,206 INFO L85 PathProgramCache]: Analyzing trace with hash 818441079, now seen corresponding path program 1 times [2021-12-15 17:07:04,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830636728] [2021-12-15 17:07:04,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:04,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:04,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830636728] [2021-12-15 17:07:04,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830636728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:04,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:04,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:07:04,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171847149] [2021-12-15 17:07:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:04,223 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:04,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:04,224 INFO L87 Difference]: Start difference. First operand 290 states and 418 transitions. cyclomatic complexity: 144 Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:04,236 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2021-12-15 17:07:04,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:04,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 786 transitions. [2021-12-15 17:07:04,242 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2021-12-15 17:07:04,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 786 transitions. [2021-12-15 17:07:04,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2021-12-15 17:07:04,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2021-12-15 17:07:04,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 786 transitions. [2021-12-15 17:07:04,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:04,255 INFO L681 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-12-15 17:07:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 786 transitions. [2021-12-15 17:07:04,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-12-15 17:07:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 562 states have (on average 1.398576512455516) internal successors, (786), 561 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2021-12-15 17:07:04,291 INFO L704 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-12-15 17:07:04,291 INFO L587 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-12-15 17:07:04,291 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:07:04,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 786 transitions. [2021-12-15 17:07:04,297 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2021-12-15 17:07:04,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:04,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:04,298 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:04,298 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:04,298 INFO L791 eck$LassoCheckResult]: Stem: 1752#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); 1753#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_~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_~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;havoc main_~cond~0#1; 1765#L99-1 [2021-12-15 17:07:04,298 INFO L793 eck$LassoCheckResult]: Loop: 1765#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 1846#L31 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; 1842#L48 assume !(0 != main_~p1~0#1); 1835#L48-2 assume !(0 != main_~p2~0#1); 1830#L52-1 assume !(0 != main_~p3~0#1); 1823#L56-1 assume !(0 != main_~p4~0#1); 1815#L60-1 assume !(0 != main_~p5~0#1); 1809#L64-1 assume !(0 != main_~p6~0#1); 1803#L68-1 assume !(0 != main_~p1~0#1); 1804#L74-1 assume !(0 != main_~p2~0#1); 1873#L79-1 assume !(0 != main_~p3~0#1); 1864#L84-1 assume !(0 != main_~p4~0#1); 1857#L89-1 assume !(0 != main_~p5~0#1); 1853#L94-1 assume !(0 != main_~p6~0#1); 1765#L99-1 [2021-12-15 17:07:04,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-15 17:07:04,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459588474] [2021-12-15 17:07:04,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,307 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1701518855, now seen corresponding path program 1 times [2021-12-15 17:07:04,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156573914] [2021-12-15 17:07:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,311 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,316 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1159342651, now seen corresponding path program 1 times [2021-12-15 17:07:04,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645841698] [2021-12-15 17:07:04,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,322 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,328 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:04,441 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:855) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:07:04,445 INFO L158 Benchmark]: Toolchain (without parser) took 1631.49ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 73.6MB in the beginning and 70.0MB in the end (delta: 3.6MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2021-12-15 17:07:04,446 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:07:04,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.53ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 73.6MB in the beginning and 98.6MB in the end (delta: -24.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:07:04,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.30ms. Allocated memory is still 121.6MB. Free memory was 98.6MB in the beginning and 97.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:07:04,452 INFO L158 Benchmark]: Boogie Preprocessor took 35.16ms. Allocated memory is still 121.6MB. Free memory was 97.0MB in the beginning and 95.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:07:04,452 INFO L158 Benchmark]: RCFGBuilder took 223.96ms. Allocated memory is still 121.6MB. Free memory was 95.5MB in the beginning and 85.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:07:04,453 INFO L158 Benchmark]: BuchiAutomizer took 1123.43ms. Allocated memory is still 121.6MB. Free memory was 85.5MB in the beginning and 70.0MB in the end (delta: 15.5MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2021-12-15 17:07:04,461 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.18ms. Allocated memory is still 100.7MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.53ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 73.6MB in the beginning and 98.6MB in the end (delta: -24.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.30ms. Allocated memory is still 121.6MB. Free memory was 98.6MB in the beginning and 97.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.16ms. Allocated memory is still 121.6MB. Free memory was 97.0MB in the beginning and 95.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 223.96ms. Allocated memory is still 121.6MB. Free memory was 95.5MB in the beginning and 85.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1123.43ms. Allocated memory is still 121.6MB. Free memory was 85.5MB in the beginning and 70.0MB in the end (delta: 15.5MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:07:04,497 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable