./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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_8.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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:48:53,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:48:53,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:48:53,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:48:53,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:48:53,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:48:53,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:48:53,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:48:53,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:48:53,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:48:53,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:48:53,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:48:53,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:48:53,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:48:53,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:48:53,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:48:53,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:48:53,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:48:53,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:48:53,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:48:53,847 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:48:53,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:48:53,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:48:53,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:48:53,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:48:53,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:48:53,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:48:53,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:48:53,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:48:53,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:48:53,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:48:53,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:48:53,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:48:53,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:48:53,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:48:53,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:48:53,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:48:53,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:48:53,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:48:53,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:48:53,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:48:53,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:48:53,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 01:48:53,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:48:53,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:48:53,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:48:53,915 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:48:53,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:48:53,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:48:53,916 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:48:53,917 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:48:53,917 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:48:53,918 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:48:53,918 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:48:53,918 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:48:53,919 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:48:53,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:48:53,919 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 01:48:53,919 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:48:53,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:48:53,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 01:48:53,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:48:53,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:48:53,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:48:53,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:48:53,921 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 01:48:53,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:48:53,922 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:48:53,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:48:53,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:48:53,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:48:53,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:48:53,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:48:53,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:48:53,926 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:48:53,926 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2022-07-22 01:48:54,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:48:54,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:48:54,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:48:54,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:48:54,341 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:48:54,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2022-07-22 01:48:54,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5e1fc5f/5535cd21cfe14413aa5d46083c481f92/FLAG3457a1aef [2022-07-22 01:48:54,878 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:48:54,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2022-07-22 01:48:54,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5e1fc5f/5535cd21cfe14413aa5d46083c481f92/FLAG3457a1aef [2022-07-22 01:48:55,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5e1fc5f/5535cd21cfe14413aa5d46083c481f92 [2022-07-22 01:48:55,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:48:55,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:48:55,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:48:55,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:48:55,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:48:55,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744be6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55, skipping insertion in model container [2022-07-22 01:48:55,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:48:55,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:48:55,594 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_8.c[3218,3231] [2022-07-22 01:48:55,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:48:55,605 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:48:55,673 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_8.c[3218,3231] [2022-07-22 01:48:55,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:48:55,693 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:48:55,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55 WrapperNode [2022-07-22 01:48:55,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:48:55,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:48:55,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:48:55,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:48:55,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,732 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 107 [2022-07-22 01:48:55,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:48:55,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:48:55,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:48:55,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:48:55,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:48:55,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:48:55,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:48:55,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:48:55,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55" (1/1) ... [2022-07-22 01:48:55,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:48:55,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:48:55,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:48:55,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 01:48:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 01:48:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:48:55,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:48:55,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 01:48:55,934 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:48:55,936 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:48:56,158 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:48:56,163 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:48:56,163 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 01:48:56,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:48:56 BoogieIcfgContainer [2022-07-22 01:48:56,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:48:56,166 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:48:56,166 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:48:56,169 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:48:56,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:48:56,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:48:55" (1/3) ... [2022-07-22 01:48:56,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70eeff16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:48:56, skipping insertion in model container [2022-07-22 01:48:56,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:48:56,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:48:55" (2/3) ... [2022-07-22 01:48:56,184 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70eeff16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:48:56, skipping insertion in model container [2022-07-22 01:48:56,184 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:48:56,184 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:48:56" (3/3) ... [2022-07-22 01:48:56,185 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2022-07-22 01:48:56,245 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:48:56,245 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:48:56,245 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:48:56,245 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:48:56,246 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:48:56,246 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:48:56,246 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:48:56,246 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:48:56,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:56,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-07-22 01:48:56,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:56,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:56,280 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:56,280 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:56,281 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:48:56,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:56,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-07-22 01:48:56,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:56,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:56,288 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:56,288 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:56,295 INFO L752 eck$LassoCheckResult]: Stem: 18#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); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 21#L127-1true [2022-07-22 01:48:56,297 INFO L754 eck$LassoCheckResult]: Loop: 21#L127-1true assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 28#L37true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 6#L58true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 13#L58-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 15#L62-1true assume !(0 != main_~p3~0#1); 29#L66-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 30#L70-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 32#L74-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 26#L78-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 10#L82-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8#L86-1true assume !(0 != main_~p1~0#1); 5#L92-1true assume !(0 != main_~p2~0#1); 16#L97-1true assume !(0 != main_~p3~0#1); 23#L102-1true assume !(0 != main_~p4~0#1); 20#L107-1true assume !(0 != main_~p5~0#1); 33#L112-1true assume !(0 != main_~p6~0#1); 31#L117-1true assume !(0 != main_~p7~0#1); 11#L122-1true assume !(0 != main_~p8~0#1); 21#L127-1true [2022-07-22 01:48:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 01:48:56,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:56,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765433324] [2022-07-22 01:48:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:56,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:56,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:56,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:56,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:56,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2022-07-22 01:48:56,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:56,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745890846] [2022-07-22 01:48:56,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:56,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:56,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745890846] [2022-07-22 01:48:56,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745890846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:56,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:56,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866454306] [2022-07-22 01:48:56,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:56,546 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:56,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:56,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:56,576 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:56,606 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2022-07-22 01:48:56,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:56,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 106 transitions. [2022-07-22 01:48:56,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-07-22 01:48:56,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 83 transitions. [2022-07-22 01:48:56,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2022-07-22 01:48:56,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-07-22 01:48:56,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2022-07-22 01:48:56,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:56,634 INFO L369 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-07-22 01:48:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2022-07-22 01:48:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-22 01:48:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 52 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2022-07-22 01:48:56,669 INFO L392 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-07-22 01:48:56,669 INFO L374 stractBuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-07-22 01:48:56,670 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:48:56,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2022-07-22 01:48:56,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-07-22 01:48:56,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:56,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:56,675 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:56,676 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:56,676 INFO L752 eck$LassoCheckResult]: Stem: 125#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); 112#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 113#L127-1 [2022-07-22 01:48:56,676 INFO L754 eck$LassoCheckResult]: Loop: 113#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 140#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 138#L58 assume !(0 != main_~p1~0#1); 139#L58-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 157#L62-1 assume !(0 != main_~p3~0#1); 156#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 155#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 154#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 153#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 152#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 151#L86-1 assume !(0 != main_~p1~0#1); 109#L92-1 assume !(0 != main_~p2~0#1); 108#L97-1 assume !(0 != main_~p3~0#1); 123#L102-1 assume !(0 != main_~p4~0#1); 129#L107-1 assume !(0 != main_~p5~0#1); 143#L112-1 assume !(0 != main_~p6~0#1); 137#L117-1 assume !(0 != main_~p7~0#1); 131#L122-1 assume !(0 != main_~p8~0#1); 113#L127-1 [2022-07-22 01:48:56,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-22 01:48:56,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:56,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348197298] [2022-07-22 01:48:56,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:56,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:56,695 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:56,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:56,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:56,709 INFO L85 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2022-07-22 01:48:56,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:56,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452546457] [2022-07-22 01:48:56,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:56,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:56,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:56,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452546457] [2022-07-22 01:48:56,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452546457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:56,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:56,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505899386] [2022-07-22 01:48:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:56,769 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:56,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:56,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:56,770 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:56,804 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2022-07-22 01:48:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:56,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2022-07-22 01:48:56,808 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2022-07-22 01:48:56,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2022-07-22 01:48:56,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2022-07-22 01:48:56,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2022-07-22 01:48:56,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2022-07-22 01:48:56,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:56,818 INFO L369 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-07-22 01:48:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2022-07-22 01:48:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-22 01:48:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 101 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2022-07-22 01:48:56,829 INFO L392 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-07-22 01:48:56,829 INFO L374 stractBuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-07-22 01:48:56,829 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:48:56,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2022-07-22 01:48:56,832 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2022-07-22 01:48:56,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:56,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:56,835 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:56,835 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:56,836 INFO L752 eck$LassoCheckResult]: Stem: 289#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); 273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 274#L127-1 [2022-07-22 01:48:56,836 INFO L754 eck$LassoCheckResult]: Loop: 274#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 325#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 323#L58 assume !(0 != main_~p1~0#1); 320#L58-2 assume !(0 != main_~p2~0#1); 318#L62-1 assume !(0 != main_~p3~0#1); 316#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 314#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 312#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 310#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 308#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 306#L86-1 assume !(0 != main_~p1~0#1); 307#L92-1 assume !(0 != main_~p2~0#1); 348#L97-1 assume !(0 != main_~p3~0#1); 345#L102-1 assume !(0 != main_~p4~0#1); 341#L107-1 assume !(0 != main_~p5~0#1); 336#L112-1 assume !(0 != main_~p6~0#1); 333#L117-1 assume !(0 != main_~p7~0#1); 329#L122-1 assume !(0 != main_~p8~0#1); 274#L127-1 [2022-07-22 01:48:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-22 01:48:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:56,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67333673] [2022-07-22 01:48:56,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:56,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:56,852 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:56,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:56,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:56,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2022-07-22 01:48:56,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:56,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160134502] [2022-07-22 01:48:56,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:56,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160134502] [2022-07-22 01:48:56,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160134502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:56,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:56,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:56,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745879742] [2022-07-22 01:48:56,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:56,914 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:56,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:56,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:56,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:56,916 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:56,938 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2022-07-22 01:48:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:56,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2022-07-22 01:48:56,945 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2022-07-22 01:48:56,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2022-07-22 01:48:56,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2022-07-22 01:48:56,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2022-07-22 01:48:56,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2022-07-22 01:48:56,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:56,955 INFO L369 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-07-22 01:48:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2022-07-22 01:48:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-07-22 01:48:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 197 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2022-07-22 01:48:56,976 INFO L392 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-07-22 01:48:56,976 INFO L374 stractBuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-07-22 01:48:56,976 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:48:56,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2022-07-22 01:48:56,980 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2022-07-22 01:48:56,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:56,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:56,981 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:56,981 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:56,981 INFO L752 eck$LassoCheckResult]: Stem: 597#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); 580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 581#L127-1 [2022-07-22 01:48:56,981 INFO L754 eck$LassoCheckResult]: Loop: 581#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 645#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 638#L58 assume !(0 != main_~p1~0#1); 639#L58-2 assume !(0 != main_~p2~0#1); 630#L62-1 assume !(0 != main_~p3~0#1); 631#L66-1 assume !(0 != main_~p4~0#1); 701#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 700#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 699#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 698#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 697#L86-1 assume !(0 != main_~p1~0#1); 694#L92-1 assume !(0 != main_~p2~0#1); 690#L97-1 assume !(0 != main_~p3~0#1); 688#L102-1 assume !(0 != main_~p4~0#1); 676#L107-1 assume !(0 != main_~p5~0#1); 675#L112-1 assume !(0 != main_~p6~0#1); 655#L117-1 assume !(0 != main_~p7~0#1); 654#L122-1 assume !(0 != main_~p8~0#1); 581#L127-1 [2022-07-22 01:48:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:56,982 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-22 01:48:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:56,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148375412] [2022-07-22 01:48:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:56,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:56,994 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:57,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2022-07-22 01:48:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:57,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443402002] [2022-07-22 01:48:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:57,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:57,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:57,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443402002] [2022-07-22 01:48:57,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443402002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:57,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:57,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968549840] [2022-07-22 01:48:57,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:57,055 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:57,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:57,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:57,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:57,058 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:57,080 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2022-07-22 01:48:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:57,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2022-07-22 01:48:57,084 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2022-07-22 01:48:57,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2022-07-22 01:48:57,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2022-07-22 01:48:57,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2022-07-22 01:48:57,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2022-07-22 01:48:57,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:57,094 INFO L369 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-07-22 01:48:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2022-07-22 01:48:57,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-07-22 01:48:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.4974093264248705) internal successors, (578), 385 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2022-07-22 01:48:57,123 INFO L392 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-07-22 01:48:57,123 INFO L374 stractBuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-07-22 01:48:57,124 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:48:57,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2022-07-22 01:48:57,125 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2022-07-22 01:48:57,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:57,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:57,126 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:57,126 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:57,126 INFO L752 eck$LassoCheckResult]: Stem: 1186#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); 1169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 1170#L127-1 [2022-07-22 01:48:57,126 INFO L754 eck$LassoCheckResult]: Loop: 1170#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1273#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 1266#L58 assume !(0 != main_~p1~0#1); 1268#L58-2 assume !(0 != main_~p2~0#1); 1246#L62-1 assume !(0 != main_~p3~0#1); 1247#L66-1 assume !(0 != main_~p4~0#1); 1335#L70-1 assume !(0 != main_~p5~0#1); 1330#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1331#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1322#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1323#L86-1 assume !(0 != main_~p1~0#1); 1359#L92-1 assume !(0 != main_~p2~0#1); 1357#L97-1 assume !(0 != main_~p3~0#1); 1355#L102-1 assume !(0 != main_~p4~0#1); 1354#L107-1 assume !(0 != main_~p5~0#1); 1352#L112-1 assume !(0 != main_~p6~0#1); 1351#L117-1 assume !(0 != main_~p7~0#1); 1287#L122-1 assume !(0 != main_~p8~0#1); 1170#L127-1 [2022-07-22 01:48:57,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-22 01:48:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:57,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52904004] [2022-07-22 01:48:57,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:57,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:57,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2022-07-22 01:48:57,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:57,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595112226] [2022-07-22 01:48:57,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:57,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:57,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:57,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595112226] [2022-07-22 01:48:57,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595112226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:57,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:57,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:57,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462586909] [2022-07-22 01:48:57,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:57,203 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:57,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:57,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:57,204 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:57,218 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2022-07-22 01:48:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:57,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2022-07-22 01:48:57,232 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2022-07-22 01:48:57,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2022-07-22 01:48:57,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2022-07-22 01:48:57,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2022-07-22 01:48:57,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2022-07-22 01:48:57,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:57,240 INFO L369 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-07-22 01:48:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2022-07-22 01:48:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2022-07-22 01:48:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.46684350132626) internal successors, (1106), 753 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2022-07-22 01:48:57,268 INFO L392 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-07-22 01:48:57,268 INFO L374 stractBuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-07-22 01:48:57,268 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:48:57,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2022-07-22 01:48:57,273 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2022-07-22 01:48:57,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:57,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:57,275 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:57,275 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:57,275 INFO L752 eck$LassoCheckResult]: Stem: 2329#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); 2315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 2316#L127-1 [2022-07-22 01:48:57,276 INFO L754 eck$LassoCheckResult]: Loop: 2316#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 2415#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 2411#L58 assume !(0 != main_~p1~0#1); 2408#L58-2 assume !(0 != main_~p2~0#1); 2406#L62-1 assume !(0 != main_~p3~0#1); 2403#L66-1 assume !(0 != main_~p4~0#1); 2399#L70-1 assume !(0 != main_~p5~0#1); 2396#L74-1 assume !(0 != main_~p6~0#1); 2394#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2391#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2387#L86-1 assume !(0 != main_~p1~0#1); 2385#L92-1 assume !(0 != main_~p2~0#1); 2381#L97-1 assume !(0 != main_~p3~0#1); 2378#L102-1 assume !(0 != main_~p4~0#1); 2379#L107-1 assume !(0 != main_~p5~0#1); 2426#L112-1 assume !(0 != main_~p6~0#1); 2423#L117-1 assume !(0 != main_~p7~0#1); 2420#L122-1 assume !(0 != main_~p8~0#1); 2316#L127-1 [2022-07-22 01:48:57,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:57,276 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-22 01:48:57,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:57,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343868259] [2022-07-22 01:48:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:57,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2022-07-22 01:48:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:57,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918347124] [2022-07-22 01:48:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:57,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:57,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:57,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918347124] [2022-07-22 01:48:57,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918347124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:57,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:57,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:48:57,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950282390] [2022-07-22 01:48:57,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:57,339 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:57,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:57,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:57,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:57,340 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:57,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:57,354 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2022-07-22 01:48:57,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:57,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2022-07-22 01:48:57,382 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2022-07-22 01:48:57,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2022-07-22 01:48:57,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2022-07-22 01:48:57,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2022-07-22 01:48:57,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2022-07-22 01:48:57,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:57,398 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-07-22 01:48:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2022-07-22 01:48:57,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2022-07-22 01:48:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1474 states have (on average 1.4341926729986432) internal successors, (2114), 1473 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2022-07-22 01:48:57,431 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-07-22 01:48:57,431 INFO L374 stractBuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-07-22 01:48:57,432 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:48:57,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2022-07-22 01:48:57,442 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2022-07-22 01:48:57,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:57,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:57,446 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:57,446 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:57,447 INFO L752 eck$LassoCheckResult]: Stem: 4564#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); 4550#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 4551#L127-1 [2022-07-22 01:48:57,448 INFO L754 eck$LassoCheckResult]: Loop: 4551#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 4806#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 4807#L58 assume !(0 != main_~p1~0#1); 4818#L58-2 assume !(0 != main_~p2~0#1); 4816#L62-1 assume !(0 != main_~p3~0#1); 4812#L66-1 assume !(0 != main_~p4~0#1); 4809#L70-1 assume !(0 != main_~p5~0#1); 4770#L74-1 assume !(0 != main_~p6~0#1); 4767#L78-1 assume !(0 != main_~p7~0#1); 4765#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4730#L86-1 assume !(0 != main_~p1~0#1); 4724#L92-1 assume !(0 != main_~p2~0#1); 4725#L97-1 assume !(0 != main_~p3~0#1); 4711#L102-1 assume !(0 != main_~p4~0#1); 4713#L107-1 assume !(0 != main_~p5~0#1); 4831#L112-1 assume !(0 != main_~p6~0#1); 4827#L117-1 assume !(0 != main_~p7~0#1); 4824#L122-1 assume !(0 != main_~p8~0#1); 4551#L127-1 [2022-07-22 01:48:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-07-22 01:48:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:57,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408646353] [2022-07-22 01:48:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,459 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:57,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2022-07-22 01:48:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:57,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530874571] [2022-07-22 01:48:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:57,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:48:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:48:57,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:48:57,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530874571] [2022-07-22 01:48:57,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530874571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:48:57,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:48:57,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 01:48:57,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295001876] [2022-07-22 01:48:57,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:48:57,505 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:48:57,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:48:57,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:48:57,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:48:57,506 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:48:57,538 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2022-07-22 01:48:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:48:57,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2022-07-22 01:48:57,568 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2022-07-22 01:48:57,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2022-07-22 01:48:57,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2022-07-22 01:48:57,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2022-07-22 01:48:57,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2022-07-22 01:48:57,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:48:57,609 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-07-22 01:48:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2022-07-22 01:48:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2022-07-22 01:48:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2882 states have (on average 1.3997224149895906) internal successors, (4034), 2881 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:48:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2022-07-22 01:48:57,672 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-07-22 01:48:57,673 INFO L374 stractBuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-07-22 01:48:57,673 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 01:48:57,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2022-07-22 01:48:57,693 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2022-07-22 01:48:57,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:48:57,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:48:57,706 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:48:57,706 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:48:57,706 INFO L752 eck$LassoCheckResult]: Stem: 8925#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); 8910#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 8911#L127-1 [2022-07-22 01:48:57,706 INFO L754 eck$LassoCheckResult]: Loop: 8911#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 9035#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 9033#L58 assume !(0 != main_~p1~0#1); 9027#L58-2 assume !(0 != main_~p2~0#1); 9029#L62-1 assume !(0 != main_~p3~0#1); 9017#L66-1 assume !(0 != main_~p4~0#1); 9019#L70-1 assume !(0 != main_~p5~0#1); 9005#L74-1 assume !(0 != main_~p6~0#1); 9007#L78-1 assume !(0 != main_~p7~0#1); 8993#L82-1 assume !(0 != main_~p8~0#1); 8995#L86-1 assume !(0 != main_~p1~0#1); 9058#L92-1 assume !(0 != main_~p2~0#1); 9056#L97-1 assume !(0 != main_~p3~0#1); 9053#L102-1 assume !(0 != main_~p4~0#1); 9051#L107-1 assume !(0 != main_~p5~0#1); 9047#L112-1 assume !(0 != main_~p6~0#1); 9043#L117-1 assume !(0 != main_~p7~0#1); 9039#L122-1 assume !(0 != main_~p8~0#1); 8911#L127-1 [2022-07-22 01:48:57,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-07-22 01:48:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:57,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351678616] [2022-07-22 01:48:57,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:57,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,714 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:57,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:57,728 INFO L85 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2022-07-22 01:48:57,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:57,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981479336] [2022-07-22 01:48:57,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,740 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:48:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2022-07-22 01:48:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:48:57,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220878204] [2022-07-22 01:48:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:48:57,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:48:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:48:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:48:57,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:48:58,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 01:48:58 BoogieIcfgContainer [2022-07-22 01:48:58,036 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 01:48:58,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 01:48:58,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 01:48:58,037 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 01:48:58,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:48:56" (3/4) ... [2022-07-22 01:48:58,040 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-22 01:48:58,074 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 01:48:58,074 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 01:48:58,075 INFO L158 Benchmark]: Toolchain (without parser) took 2695.12ms. Allocated memory was 52.4MB in the beginning and 86.0MB in the end (delta: 33.6MB). Free memory was 30.2MB in the beginning and 30.4MB in the end (delta: -273.9kB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2022-07-22 01:48:58,075 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:48:58,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.36ms. Allocated memory was 52.4MB in the beginning and 71.3MB in the end (delta: 18.9MB). Free memory was 29.9MB in the beginning and 55.0MB in the end (delta: -25.1MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-07-22 01:48:58,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.02ms. Allocated memory is still 71.3MB. Free memory was 54.8MB in the beginning and 53.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:48:58,076 INFO L158 Benchmark]: Boogie Preprocessor took 44.37ms. Allocated memory is still 71.3MB. Free memory was 53.2MB in the beginning and 52.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:48:58,077 INFO L158 Benchmark]: RCFGBuilder took 386.33ms. Allocated memory is still 71.3MB. Free memory was 52.1MB in the beginning and 41.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 01:48:58,077 INFO L158 Benchmark]: BuchiAutomizer took 1870.31ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 41.4MB in the beginning and 32.5MB in the end (delta: 8.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-22 01:48:58,077 INFO L158 Benchmark]: Witness Printer took 37.62ms. Allocated memory is still 86.0MB. Free memory was 32.5MB in the beginning and 30.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:48:58,079 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.20ms. Allocated memory is still 52.4MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.36ms. Allocated memory was 52.4MB in the beginning and 71.3MB in the end (delta: 18.9MB). Free memory was 29.9MB in the beginning and 55.0MB in the end (delta: -25.1MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.02ms. Allocated memory is still 71.3MB. Free memory was 54.8MB in the beginning and 53.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.37ms. Allocated memory is still 71.3MB. Free memory was 53.2MB in the beginning and 52.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 386.33ms. Allocated memory is still 71.3MB. Free memory was 52.1MB in the beginning and 41.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1870.31ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 41.4MB in the beginning and 32.5MB in the end (delta: 8.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 37.62ms. Allocated memory is still 86.0MB. Free memory was 32.5MB in the beginning and 30.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 459 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI7 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {lk5=0, p1=0, NULL=0, NULL=1, cond=4, p5=0, lk2=0, p4=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@589d9ae3=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2214b320=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@92148bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bfa75b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d25ef49=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@89bc258=0, \result=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75b5c9a8=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f17bf63=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7dea5c6f=0, p2=0, lk4=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-22 01:48:58,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)