./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 5fbdf5bf 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 8a6bc1adbcafb13db44c5d4b4826990150e2f336 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 02:02:55,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 02:02:55,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 02:02:55,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 02:02:55,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 02:02:55,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 02:02:55,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 02:02:55,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 02:02:55,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 02:02:55,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 02:02:55,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 02:02:55,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 02:02:55,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 02:02:55,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 02:02:55,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 02:02:55,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 02:02:55,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 02:02:55,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 02:02:55,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 02:02:55,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 02:02:55,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 02:02:55,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 02:02:55,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 02:02:55,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 02:02:55,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 02:02:55,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 02:02:55,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 02:02:55,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 02:02:55,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 02:02:55,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 02:02:55,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 02:02:55,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 02:02:55,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 02:02:55,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 02:02:55,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 02:02:55,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 02:02:55,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 02:02:55,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 02:02:55,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 02:02:55,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 02:02:55,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 02:02:55,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 02:02:55,865 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 02:02:55,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 02:02:55,866 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 02:02:55,867 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 02:02:55,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 02:02:55,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 02:02:55,869 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 02:02:55,869 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 02:02:55,869 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 02:02:55,869 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 02:02:55,870 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 02:02:55,870 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 02:02:55,870 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 02:02:55,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 02:02:55,870 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 02:02:55,870 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 02:02:55,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 02:02:55,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 02:02:55,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 02:02:55,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 02:02:55,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 02:02:55,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 02:02:55,879 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 02:02:55,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 02:02:55,879 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 02:02:55,879 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 02:02:55,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 02:02:55,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 02:02:55,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 02:02:55,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 02:02:55,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 02:02:55,880 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 02:02:55,882 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 02:02:55,882 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 -> 8a6bc1adbcafb13db44c5d4b4826990150e2f336 [2021-08-31 02:02:56,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 02:02:56,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 02:02:56,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 02:02:56,226 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 02:02:56,227 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 02:02:56,228 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-08-31 02:02:56,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c3a33336/c151923d76b243a79716d6d20a84282a/FLAG2e23f76ae [2021-08-31 02:02:56,776 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 02:02:56,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2021-08-31 02:02:56,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c3a33336/c151923d76b243a79716d6d20a84282a/FLAG2e23f76ae [2021-08-31 02:02:57,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c3a33336/c151923d76b243a79716d6d20a84282a [2021-08-31 02:02:57,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 02:02:57,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 02:02:57,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 02:02:57,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 02:02:57,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 02:02:57,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d27edf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57, skipping insertion in model container [2021-08-31 02:02:57,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 02:02:57,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 02:02:57,506 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c[2544,2557] [2021-08-31 02:02:57,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:02:57,546 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 02:02:57,595 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c[2544,2557] [2021-08-31 02:02:57,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:02:57,640 INFO L208 MainTranslator]: Completed translation [2021-08-31 02:02:57,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57 WrapperNode [2021-08-31 02:02:57,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 02:02:57,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 02:02:57,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 02:02:57,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 02:02:57,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 02:02:57,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 02:02:57,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 02:02:57,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 02:02:57,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 02:02:57,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 02:02:57,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 02:02:57,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 02:02:57,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57" (1/1) ... [2021-08-31 02:02:57,774 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:02:57,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:02:57,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:02:57,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-31 02:02:57,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 02:02:57,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 02:02:57,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 02:02:57,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 02:02:57,977 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 02:02:57,977 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-31 02:02:57,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:02:57 BoogieIcfgContainer [2021-08-31 02:02:57,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 02:02:57,980 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 02:02:57,980 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 02:02:57,982 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 02:02:57,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:57,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 02:02:57" (1/3) ... [2021-08-31 02:02:57,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@164187a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:02:57, skipping insertion in model container [2021-08-31 02:02:57,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:57,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:57" (2/3) ... [2021-08-31 02:02:57,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@164187a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:02:57, skipping insertion in model container [2021-08-31 02:02:57,985 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:57,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:02:57" (3/3) ... [2021-08-31 02:02:57,986 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2021-08-31 02:02:58,029 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 02:02:58,030 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 02:02:58,030 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 02:02:58,030 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 02:02:58,030 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 02:02:58,030 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 02:02:58,030 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 02:02:58,030 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 02:02:58,041 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-08-31 02:02:58,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-08-31 02:02:58,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:58,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:58,109 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:58,110 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:58,110 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 02:02:58,110 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-08-31 02:02:58,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-08-31 02:02:58,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:58,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:58,116 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:58,116 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:58,124 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 9#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 12#L99-1true [2021-08-31 02:02:58,125 INFO L793 eck$LassoCheckResult]: Loop: 12#L99-1true assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 8#L31true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 15#L48true assume 0 != main_~p1~0;main_~lk1~0 := 1; 4#L48-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 28#L52-1true assume !(0 != main_~p3~0); 21#L56-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 6#L60-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 25#L64-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 24#L68-1true assume !(0 != main_~p1~0); 27#L74-1true assume !(0 != main_~p2~0); 13#L79-1true assume !(0 != main_~p3~0); 23#L84-1true assume !(0 != main_~p4~0); 14#L89-1true assume !(0 != main_~p5~0); 11#L94-1true assume !(0 != main_~p6~0); 12#L99-1true [2021-08-31 02:02:58,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:58,134 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 02:02:58,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:58,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047696689] [2021-08-31 02:02:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:58,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:58,245 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:58,295 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:58,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:58,300 INFO L82 PathProgramCache]: Analyzing trace with hash -11500681, now seen corresponding path program 1 times [2021-08-31 02:02:58,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:58,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953007134] [2021-08-31 02:02:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:58,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:58,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:58,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953007134] [2021-08-31 02:02:58,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953007134] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:58,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:58,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:58,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485739532] [2021-08-31 02:02:58,414 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:58,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:58,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:58,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:58,444 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-08-31 02:02:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:58,597 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2021-08-31 02:02:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:58,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 82 transitions. [2021-08-31 02:02:58,605 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-08-31 02:02:58,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 41 states and 63 transitions. [2021-08-31 02:02:58,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-08-31 02:02:58,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-08-31 02:02:58,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2021-08-31 02:02:58,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:58,610 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-08-31 02:02:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2021-08-31 02:02:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-08-31 02:02:58,632 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-08-31 02:02:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2021-08-31 02:02:58,634 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-08-31 02:02:58,634 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-08-31 02:02:58,634 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 02:02:58,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2021-08-31 02:02:58,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-08-31 02:02:58,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:58,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:58,636 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:58,636 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:58,637 INFO L791 eck$LassoCheckResult]: Stem: 89#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 90#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 104#L99-1 [2021-08-31 02:02:58,637 INFO L793 eck$LassoCheckResult]: Loop: 104#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 119#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 118#L48 assume !(0 != main_~p1~0); 87#L48-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 88#L52-1 assume !(0 != main_~p3~0); 117#L56-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 116#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 115#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 114#L68-1 assume !(0 != main_~p1~0); 111#L74-1 assume !(0 != main_~p2~0); 109#L79-1 assume !(0 != main_~p3~0); 92#L84-1 assume !(0 != main_~p4~0); 123#L89-1 assume !(0 != main_~p5~0); 121#L94-1 assume !(0 != main_~p6~0); 104#L99-1 [2021-08-31 02:02:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:58,638 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-31 02:02:58,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:58,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536625718] [2021-08-31 02:02:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:58,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:58,647 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:58,657 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash 246664757, now seen corresponding path program 1 times [2021-08-31 02:02:58,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:58,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380979165] [2021-08-31 02:02:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:58,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:58,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:58,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380979165] [2021-08-31 02:02:58,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380979165] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:58,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:58,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:58,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108651273] [2021-08-31 02:02:58,678 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:58,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:58,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:58,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:58,679 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-08-31 02:02:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:58,749 INFO L93 Difference]: Finished difference Result 78 states and 118 transitions. [2021-08-31 02:02:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:58,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 118 transitions. [2021-08-31 02:02:58,752 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2021-08-31 02:02:58,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 118 transitions. [2021-08-31 02:02:58,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2021-08-31 02:02:58,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2021-08-31 02:02:58,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 118 transitions. [2021-08-31 02:02:58,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:58,755 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-08-31 02:02:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 118 transitions. [2021-08-31 02:02:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-08-31 02:02:58,759 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-08-31 02:02:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2021-08-31 02:02:58,760 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-08-31 02:02:58,761 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-08-31 02:02:58,761 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 02:02:58,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 118 transitions. [2021-08-31 02:02:58,762 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2021-08-31 02:02:58,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:58,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:58,762 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:58,763 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:58,763 INFO L791 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 215#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 227#L99-1 [2021-08-31 02:02:58,763 INFO L793 eck$LassoCheckResult]: Loop: 227#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 263#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 259#L48 assume !(0 != main_~p1~0); 258#L48-2 assume !(0 != main_~p2~0); 257#L52-1 assume !(0 != main_~p3~0); 255#L56-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 253#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 251#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 249#L68-1 assume !(0 != main_~p1~0); 240#L74-1 assume !(0 != main_~p2~0); 238#L79-1 assume !(0 != main_~p3~0); 217#L84-1 assume !(0 != main_~p4~0); 276#L89-1 assume !(0 != main_~p5~0); 272#L94-1 assume !(0 != main_~p6~0); 227#L99-1 [2021-08-31 02:02:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-31 02:02:58,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:58,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095450896] [2021-08-31 02:02:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:58,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:58,772 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:58,781 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:58,782 INFO L82 PathProgramCache]: Analyzing trace with hash 947729335, now seen corresponding path program 1 times [2021-08-31 02:02:58,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:58,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700159038] [2021-08-31 02:02:58,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:58,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:58,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:58,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700159038] [2021-08-31 02:02:58,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700159038] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:58,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:58,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:58,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196843757] [2021-08-31 02:02:58,814 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:58,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:58,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:58,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:58,815 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-08-31 02:02:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:58,876 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2021-08-31 02:02:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:58,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 222 transitions. [2021-08-31 02:02:58,879 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2021-08-31 02:02:58,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 222 transitions. [2021-08-31 02:02:58,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2021-08-31 02:02:58,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2021-08-31 02:02:58,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 222 transitions. [2021-08-31 02:02:58,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:58,882 INFO L681 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-08-31 02:02:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 222 transitions. [2021-08-31 02:02:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-08-31 02:02:58,889 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-08-31 02:02:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2021-08-31 02:02:58,891 INFO L704 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-08-31 02:02:58,891 INFO L587 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-08-31 02:02:58,891 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 02:02:58,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 222 transitions. [2021-08-31 02:02:58,893 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2021-08-31 02:02:58,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:58,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:58,893 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:58,893 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:58,894 INFO L791 eck$LassoCheckResult]: Stem: 448#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 449#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 461#L99-1 [2021-08-31 02:02:58,894 INFO L793 eck$LassoCheckResult]: Loop: 461#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 503#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 498#L48 assume !(0 != main_~p1~0); 492#L48-2 assume !(0 != main_~p2~0); 485#L52-1 assume !(0 != main_~p3~0); 486#L56-1 assume !(0 != main_~p4~0); 546#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 545#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 539#L68-1 assume !(0 != main_~p1~0); 541#L74-1 assume !(0 != main_~p2~0); 538#L79-1 assume !(0 != main_~p3~0); 536#L84-1 assume !(0 != main_~p4~0); 535#L89-1 assume !(0 != main_~p5~0); 517#L94-1 assume !(0 != main_~p6~0); 461#L99-1 [2021-08-31 02:02:58,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:58,894 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-31 02:02:58,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:58,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838349261] [2021-08-31 02:02:58,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:58,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:58,902 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:58,909 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1627787705, now seen corresponding path program 1 times [2021-08-31 02:02:58,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:58,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063933428] [2021-08-31 02:02:58,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:58,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:58,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:58,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063933428] [2021-08-31 02:02:58,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063933428] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:58,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:58,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:58,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816140924] [2021-08-31 02:02:58,927 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:58,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:58,928 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-08-31 02:02:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:58,986 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2021-08-31 02:02:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:58,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 418 transitions. [2021-08-31 02:02:58,990 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2021-08-31 02:02:58,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 418 transitions. [2021-08-31 02:02:58,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2021-08-31 02:02:58,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2021-08-31 02:02:58,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 418 transitions. [2021-08-31 02:02:58,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:58,994 INFO L681 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-08-31 02:02:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 418 transitions. [2021-08-31 02:02:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2021-08-31 02:02:59,003 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-08-31 02:02:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 418 transitions. [2021-08-31 02:02:59,005 INFO L704 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-08-31 02:02:59,006 INFO L587 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-08-31 02:02:59,006 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 02:02:59,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 418 transitions. [2021-08-31 02:02:59,011 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2021-08-31 02:02:59,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:59,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:59,012 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:59,012 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:59,013 INFO L791 eck$LassoCheckResult]: Stem: 894#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 895#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 907#L99-1 [2021-08-31 02:02:59,013 INFO L793 eck$LassoCheckResult]: Loop: 907#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 955#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 953#L48 assume !(0 != main_~p1~0); 949#L48-2 assume !(0 != main_~p2~0); 947#L52-1 assume !(0 != main_~p3~0); 943#L56-1 assume !(0 != main_~p4~0); 939#L60-1 assume !(0 != main_~p5~0); 937#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 934#L68-1 assume !(0 != main_~p1~0); 935#L74-1 assume !(0 != main_~p2~0); 971#L79-1 assume !(0 != main_~p3~0); 966#L84-1 assume !(0 != main_~p4~0); 962#L89-1 assume !(0 != main_~p5~0); 959#L94-1 assume !(0 != main_~p6~0); 907#L99-1 [2021-08-31 02:02:59,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,013 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-31 02:02:59,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597098038] [2021-08-31 02:02:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,020 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,027 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:59,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,027 INFO L82 PathProgramCache]: Analyzing trace with hash 818441079, now seen corresponding path program 1 times [2021-08-31 02:02:59,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995505380] [2021-08-31 02:02:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:59,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:59,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995505380] [2021-08-31 02:02:59,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995505380] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:59,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:59,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 02:02:59,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664275776] [2021-08-31 02:02:59,042 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:59,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:59,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:59,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:59,044 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-08-31 02:02:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:59,099 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2021-08-31 02:02:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:59,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 786 transitions. [2021-08-31 02:02:59,104 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2021-08-31 02:02:59,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 786 transitions. [2021-08-31 02:02:59,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2021-08-31 02:02:59,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2021-08-31 02:02:59,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 786 transitions. [2021-08-31 02:02:59,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:59,108 INFO L681 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-08-31 02:02:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 786 transitions. [2021-08-31 02:02:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-08-31 02:02:59,119 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-08-31 02:02:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2021-08-31 02:02:59,121 INFO L704 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-08-31 02:02:59,121 INFO L587 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-08-31 02:02:59,122 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 02:02:59,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 786 transitions. [2021-08-31 02:02:59,124 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2021-08-31 02:02:59,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:59,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:59,125 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:59,125 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:59,125 INFO L791 eck$LassoCheckResult]: Stem: 1752#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1753#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 1765#L99-1 [2021-08-31 02:02:59,126 INFO L793 eck$LassoCheckResult]: Loop: 1765#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 1846#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 1842#L48 assume !(0 != main_~p1~0); 1835#L48-2 assume !(0 != main_~p2~0); 1830#L52-1 assume !(0 != main_~p3~0); 1823#L56-1 assume !(0 != main_~p4~0); 1815#L60-1 assume !(0 != main_~p5~0); 1809#L64-1 assume !(0 != main_~p6~0); 1803#L68-1 assume !(0 != main_~p1~0); 1804#L74-1 assume !(0 != main_~p2~0); 1873#L79-1 assume !(0 != main_~p3~0); 1864#L84-1 assume !(0 != main_~p4~0); 1857#L89-1 assume !(0 != main_~p5~0); 1853#L94-1 assume !(0 != main_~p6~0); 1765#L99-1 [2021-08-31 02:02:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-31 02:02:59,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7671727] [2021-08-31 02:02:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,133 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,140 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1701518855, now seen corresponding path program 1 times [2021-08-31 02:02:59,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978789145] [2021-08-31 02:02:59,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,144 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,148 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:59,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:59,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1159342651, now seen corresponding path program 1 times [2021-08-31 02:02:59,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:59,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906461589] [2021-08-31 02:02:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:59,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,156 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:59,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:59,528 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) 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-08-31 02:02:59,531 INFO L158 Benchmark]: Toolchain (without parser) took 2210.16ms. Allocated memory was 48.2MB in the beginning and 77.6MB in the end (delta: 29.4MB). Free memory was 25.3MB in the beginning and 38.6MB in the end (delta: -13.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2021-08-31 02:02:59,532 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 48.2MB. Free memory was 30.4MB in the beginning and 30.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:02:59,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.65ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 25.2MB in the beginning and 44.9MB in the end (delta: -19.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2021-08-31 02:02:59,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.48ms. Allocated memory is still 60.8MB. Free memory was 44.8MB in the beginning and 43.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:02:59,533 INFO L158 Benchmark]: Boogie Preprocessor took 48.71ms. Allocated memory is still 60.8MB. Free memory was 43.4MB in the beginning and 42.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 02:02:59,533 INFO L158 Benchmark]: RCFGBuilder took 211.85ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 33.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-31 02:02:59,534 INFO L158 Benchmark]: BuchiAutomizer took 1550.09ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 32.9MB in the beginning and 38.6MB in the end (delta: -5.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2021-08-31 02:02:59,536 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.12ms. Allocated memory is still 48.2MB. Free memory was 30.4MB in the beginning and 30.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.65ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 25.2MB in the beginning and 44.9MB in the end (delta: -19.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.48ms. Allocated memory is still 60.8MB. Free memory was 44.8MB in the beginning and 43.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.71ms. Allocated memory is still 60.8MB. Free memory was 43.4MB in the beginning and 42.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 211.85ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 33.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1550.09ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 32.9MB in the beginning and 38.6MB in the end (delta: -5.7MB). Peak memory consumption was 18.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 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 562 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 02:02:59,588 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...