./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_15-2.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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:06:58,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:06:58,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:06:58,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:06:58,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:06:58,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:06:58,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:06:58,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:06:58,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:06:58,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:06:58,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:06:58,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:06:58,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:06:58,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:06:58,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:06:58,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:06:58,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:06:58,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:06:58,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:06:58,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:06:58,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:06:58,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:06:58,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:06:58,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:06:58,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:06:58,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:06:58,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:06:58,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:06:58,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:06:58,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:06:58,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:06:58,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:06:58,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:06:58,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:06:58,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:06:58,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:06:58,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:06:58,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:06:58,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:06:58,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:06:58,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:06:58,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:06:58,767 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:06:58,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:06:58,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:06:58,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:06:58,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:06:58,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:06:58,770 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:06:58,770 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:06:58,770 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:06:58,770 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:06:58,771 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:06:58,771 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:06:58,771 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:06:58,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:06:58,772 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:06:58,772 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:06:58,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:06:58,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:06:58,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:06:58,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:06:58,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:06:58,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:06:58,773 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:06:58,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:06:58,774 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:06:58,774 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:06:58,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:06:58,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:06:58,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:06:58,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:06:58,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:06:58,775 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:06:58,776 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:06:58,776 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2021-12-15 17:06:58,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:06:58,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:06:58,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:06:58,993 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:06:58,993 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:06:58,994 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2021-12-15 17:06:59,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f799a530/60bac322b93c4da6b653051b383e593f/FLAGb79bb1e17 [2021-12-15 17:06:59,526 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:06:59,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2021-12-15 17:06:59,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f799a530/60bac322b93c4da6b653051b383e593f/FLAGb79bb1e17 [2021-12-15 17:06:59,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f799a530/60bac322b93c4da6b653051b383e593f [2021-12-15 17:06:59,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:06:59,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:06:59,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:59,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:06:59,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:06:59,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c20e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59, skipping insertion in model container [2021-12-15 17:06:59,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:06:59,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:06:59,741 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_15-2.c[5628,5641] [2021-12-15 17:06:59,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:59,749 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:06:59,775 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_15-2.c[5628,5641] [2021-12-15 17:06:59,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:59,787 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:06:59,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59 WrapperNode [2021-12-15 17:06:59,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:59,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:59,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:06:59,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:06:59,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,833 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 177 [2021-12-15 17:06:59,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:59,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:06:59,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:06:59,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:06:59,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:06:59,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:06:59,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:06:59,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:06:59,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:59,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:59,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:06:59,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:06:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:06:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:06:59,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:06:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:07:00,045 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:07:00,046 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:07:00,191 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:07:00,197 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:07:00,198 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:07:00,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:07:00 BoogieIcfgContainer [2021-12-15 17:07:00,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:07:00,200 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:07:00,200 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:07:00,203 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:07:00,203 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:07:00,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:06:59" (1/3) ... [2021-12-15 17:07:00,204 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@447ad669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:07:00, skipping insertion in model container [2021-12-15 17:07:00,204 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:07:00,205 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (2/3) ... [2021-12-15 17:07:00,205 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@447ad669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:07:00, skipping insertion in model container [2021-12-15 17:07:00,205 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:07:00,205 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:07:00" (3/3) ... [2021-12-15 17:07:00,206 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2021-12-15 17:07:00,256 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:07:00,256 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:07:00,256 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:07:00,256 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:07:00,256 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:07:00,257 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:07:00,257 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:07:00,257 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:07:00,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-12-15 17:07:00,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,287 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,287 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,287 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:07:00,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-12-15 17:07:00,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,294 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,294 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,300 INFO L791 eck$LassoCheckResult]: Stem: 44#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(18, 2);call #Ultimate.allocInit(12, 3); 34#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 21#L225-1true [2021-12-15 17:07:00,301 INFO L793 eck$LassoCheckResult]: Loop: 21#L225-1true assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33#L58true 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 29#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 26#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 14#L97-1true assume !(0 != main_~p3~0#1); 17#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 51#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 46#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 13#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 23#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 31#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 18#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 36#L129-1true assume !(0 != main_~p11~0#1); 4#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 41#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 55#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 49#L149-1true assume !(0 != main_~p1~0#1); 48#L155-1true assume !(0 != main_~p2~0#1); 28#L160-1true assume !(0 != main_~p3~0#1); 12#L165-1true assume !(0 != main_~p4~0#1); 43#L170-1true assume !(0 != main_~p5~0#1); 47#L175-1true assume !(0 != main_~p6~0#1); 19#L180-1true assume !(0 != main_~p7~0#1); 40#L185-1true assume !(0 != main_~p8~0#1); 25#L190-1true assume !(0 != main_~p9~0#1); 42#L195-1true assume !(0 != main_~p10~0#1); 16#L200-1true assume !(0 != main_~p11~0#1); 45#L205-1true assume !(0 != main_~p12~0#1); 24#L210-1true assume !(0 != main_~p13~0#1); 6#L215-1true assume !(0 != main_~p14~0#1); 38#L220-1true assume !(0 != main_~p15~0#1); 21#L225-1true [2021-12-15 17:07:00,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,306 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:07:00,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548304981] [2021-12-15 17:07:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,420 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2064553094, now seen corresponding path program 1 times [2021-12-15 17:07:00,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99893215] [2021-12-15 17:07:00,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:00,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:00,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99893215] [2021-12-15 17:07:00,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99893215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:00,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:00,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:00,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223034726] [2021-12-15 17:07:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:00,542 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:00,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:00,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:00,570 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,611 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2021-12-15 17:07:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2021-12-15 17:07:00,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-12-15 17:07:00,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 153 transitions. [2021-12-15 17:07:00,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2021-12-15 17:07:00,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2021-12-15 17:07:00,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 153 transitions. [2021-12-15 17:07:00,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,629 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-12-15 17:07:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 153 transitions. [2021-12-15 17:07:00,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-15 17:07:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2021-12-15 17:07:00,654 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-12-15 17:07:00,654 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-12-15 17:07:00,654 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:07:00,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 153 transitions. [2021-12-15 17:07:00,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-12-15 17:07:00,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,657 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,657 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,657 INFO L791 eck$LassoCheckResult]: Stem: 215#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(18, 2);call #Ultimate.allocInit(12, 3); 208#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 209#L225-1 [2021-12-15 17:07:00,658 INFO L793 eck$LassoCheckResult]: Loop: 209#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 237#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 236#L93 assume !(0 != main_~p1~0#1); 235#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 234#L97-1 assume !(0 != main_~p3~0#1); 233#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 220#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 216#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 183#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 184#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 199#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 191#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 192#L129-1 assume !(0 != main_~p11~0#1); 168#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 169#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 173#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 212#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 221#L149-1 assume !(0 != main_~p1~0#1); 222#L155-1 assume !(0 != main_~p2~0#1); 261#L160-1 assume !(0 != main_~p3~0#1); 259#L165-1 assume !(0 != main_~p4~0#1); 256#L170-1 assume !(0 != main_~p5~0#1); 255#L175-1 assume !(0 != main_~p6~0#1); 253#L180-1 assume !(0 != main_~p7~0#1); 250#L185-1 assume !(0 != main_~p8~0#1); 249#L190-1 assume !(0 != main_~p9~0#1); 247#L195-1 assume !(0 != main_~p10~0#1); 187#L200-1 assume !(0 != main_~p11~0#1); 188#L205-1 assume !(0 != main_~p12~0#1); 206#L210-1 assume !(0 != main_~p13~0#1); 241#L215-1 assume !(0 != main_~p14~0#1); 239#L220-1 assume !(0 != main_~p15~0#1); 209#L225-1 [2021-12-15 17:07:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,659 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-15 17:07:00,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143102681] [2021-12-15 17:07:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,666 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,673 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:00,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2087185348, now seen corresponding path program 1 times [2021-12-15 17:07:00,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975841724] [2021-12-15 17:07:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:00,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:00,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975841724] [2021-12-15 17:07:00,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975841724] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:00,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:00,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:00,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486351290] [2021-12-15 17:07:00,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:00,713 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:00,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:00,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:00,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:00,715 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,731 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2021-12-15 17:07:00,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 298 transitions. [2021-12-15 17:07:00,735 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-12-15 17:07:00,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 298 transitions. [2021-12-15 17:07:00,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2021-12-15 17:07:00,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2021-12-15 17:07:00,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 298 transitions. [2021-12-15 17:07:00,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,739 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-12-15 17:07:00,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 298 transitions. [2021-12-15 17:07:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-12-15 17:07:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 185 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2021-12-15 17:07:00,752 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-12-15 17:07:00,752 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-12-15 17:07:00,752 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:07:00,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 298 transitions. [2021-12-15 17:07:00,754 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-12-15 17:07:00,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,755 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,756 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,756 INFO L791 eck$LassoCheckResult]: Stem: 508#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(18, 2);call #Ultimate.allocInit(12, 3); 498#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 499#L225-1 [2021-12-15 17:07:00,756 INFO L793 eck$LassoCheckResult]: Loop: 499#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 554#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 552#L93 assume !(0 != main_~p1~0#1); 537#L93-2 assume !(0 != main_~p2~0#1); 538#L97-1 assume !(0 != main_~p3~0#1); 533#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 514#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 509#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 470#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 471#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 486#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 478#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 479#L129-1 assume !(0 != main_~p11~0#1); 455#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 456#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 460#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 515#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 516#L149-1 assume !(0 != main_~p1~0#1); 540#L155-1 assume !(0 != main_~p2~0#1); 591#L160-1 assume !(0 != main_~p3~0#1); 589#L165-1 assume !(0 != main_~p4~0#1); 586#L170-1 assume !(0 != main_~p5~0#1); 585#L175-1 assume !(0 != main_~p6~0#1); 583#L180-1 assume !(0 != main_~p7~0#1); 580#L185-1 assume !(0 != main_~p8~0#1); 579#L190-1 assume !(0 != main_~p9~0#1); 577#L195-1 assume !(0 != main_~p10~0#1); 575#L200-1 assume !(0 != main_~p11~0#1); 573#L205-1 assume !(0 != main_~p12~0#1); 571#L210-1 assume !(0 != main_~p13~0#1); 569#L215-1 assume !(0 != main_~p14~0#1); 558#L220-1 assume !(0 != main_~p15~0#1); 499#L225-1 [2021-12-15 17:07:00,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-15 17:07:00,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225743475] [2021-12-15 17:07:00,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,763 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,768 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,769 INFO L85 PathProgramCache]: Analyzing trace with hash -821578554, now seen corresponding path program 1 times [2021-12-15 17:07:00,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339954425] [2021-12-15 17:07:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:00,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:00,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339954425] [2021-12-15 17:07:00,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339954425] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:00,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:00,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:00,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314340462] [2021-12-15 17:07:00,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:00,819 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:00,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:00,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:00,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:00,821 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. cyclomatic complexity: 116 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,850 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2021-12-15 17:07:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 582 transitions. [2021-12-15 17:07:00,856 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-12-15 17:07:00,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 582 transitions. [2021-12-15 17:07:00,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2021-12-15 17:07:00,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2021-12-15 17:07:00,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 582 transitions. [2021-12-15 17:07:00,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,869 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-12-15 17:07:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 582 transitions. [2021-12-15 17:07:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-12-15 17:07:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.5901639344262295) internal successors, (582), 365 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2021-12-15 17:07:00,883 INFO L704 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-12-15 17:07:00,884 INFO L587 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-12-15 17:07:00,884 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:07:00,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 582 transitions. [2021-12-15 17:07:00,886 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-12-15 17:07:00,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,887 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,887 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,887 INFO L791 eck$LassoCheckResult]: Stem: 1067#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(18, 2);call #Ultimate.allocInit(12, 3); 1057#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1058#L225-1 [2021-12-15 17:07:00,887 INFO L793 eck$LassoCheckResult]: Loop: 1058#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1096#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1092#L93 assume !(0 != main_~p1~0#1); 1085#L93-2 assume !(0 != main_~p2~0#1); 1086#L97-1 assume !(0 != main_~p3~0#1); 1237#L101-1 assume !(0 != main_~p4~0#1); 1234#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1232#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1228#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1224#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1220#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1216#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1212#L129-1 assume !(0 != main_~p11~0#1); 1208#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1204#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1200#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1196#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1190#L149-1 assume !(0 != main_~p1~0#1); 1188#L155-1 assume !(0 != main_~p2~0#1); 1187#L160-1 assume !(0 != main_~p3~0#1); 1182#L165-1 assume !(0 != main_~p4~0#1); 1175#L170-1 assume !(0 != main_~p5~0#1); 1127#L175-1 assume !(0 != main_~p6~0#1); 1123#L180-1 assume !(0 != main_~p7~0#1); 1120#L185-1 assume !(0 != main_~p8~0#1); 1119#L190-1 assume !(0 != main_~p9~0#1); 1117#L195-1 assume !(0 != main_~p10~0#1); 1115#L200-1 assume !(0 != main_~p11~0#1); 1113#L205-1 assume !(0 != main_~p12~0#1); 1111#L210-1 assume !(0 != main_~p13~0#1); 1109#L215-1 assume !(0 != main_~p14~0#1); 1107#L220-1 assume !(0 != main_~p15~0#1); 1058#L225-1 [2021-12-15 17:07:00,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-15 17:07:00,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201285532] [2021-12-15 17:07:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,894 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,900 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1101649480, now seen corresponding path program 1 times [2021-12-15 17:07:00,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905081359] [2021-12-15 17:07:00,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:00,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:00,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905081359] [2021-12-15 17:07:00,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905081359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:00,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:00,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:00,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118816254] [2021-12-15 17:07:00,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:00,932 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:00,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:00,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:00,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:00,933 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. cyclomatic complexity: 224 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,947 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2021-12-15 17:07:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1138 transitions. [2021-12-15 17:07:00,953 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-12-15 17:07:00,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1138 transitions. [2021-12-15 17:07:00,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2021-12-15 17:07:00,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2021-12-15 17:07:00,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1138 transitions. [2021-12-15 17:07:00,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,960 INFO L681 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-12-15 17:07:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1138 transitions. [2021-12-15 17:07:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2021-12-15 17:07:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5761772853185596) internal successors, (1138), 721 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1138 transitions. [2021-12-15 17:07:00,991 INFO L704 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-12-15 17:07:00,992 INFO L587 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-12-15 17:07:00,992 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:07:00,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1138 transitions. [2021-12-15 17:07:01,020 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-12-15 17:07:01,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:01,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:01,021 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:01,021 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:01,021 INFO L791 eck$LassoCheckResult]: Stem: 2156#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(18, 2);call #Ultimate.allocInit(12, 3); 2149#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2150#L225-1 [2021-12-15 17:07:01,021 INFO L793 eck$LassoCheckResult]: Loop: 2150#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2251#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 2247#L93 assume !(0 != main_~p1~0#1); 2240#L93-2 assume !(0 != main_~p2~0#1); 2235#L97-1 assume !(0 != main_~p3~0#1); 2228#L101-1 assume !(0 != main_~p4~0#1); 2222#L105-1 assume !(0 != main_~p5~0#1); 2218#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2216#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2214#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2212#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2210#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2207#L129-1 assume !(0 != main_~p11~0#1); 2208#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2201#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2202#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2194#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2195#L149-1 assume !(0 != main_~p1~0#1); 2184#L155-1 assume !(0 != main_~p2~0#1); 2186#L160-1 assume !(0 != main_~p3~0#1); 2363#L165-1 assume !(0 != main_~p4~0#1); 2351#L170-1 assume !(0 != main_~p5~0#1); 2350#L175-1 assume !(0 != main_~p6~0#1); 2348#L180-1 assume !(0 != main_~p7~0#1); 2344#L185-1 assume !(0 != main_~p8~0#1); 2339#L190-1 assume !(0 != main_~p9~0#1); 2333#L195-1 assume !(0 != main_~p10~0#1); 2282#L200-1 assume !(0 != main_~p11~0#1); 2280#L205-1 assume !(0 != main_~p12~0#1); 2274#L210-1 assume !(0 != main_~p13~0#1); 2270#L215-1 assume !(0 != main_~p14~0#1); 2260#L220-1 assume !(0 != main_~p15~0#1); 2150#L225-1 [2021-12-15 17:07:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-15 17:07:01,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346541053] [2021-12-15 17:07:01,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,034 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,044 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:01,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1163689094, now seen corresponding path program 1 times [2021-12-15 17:07:01,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143483908] [2021-12-15 17:07:01,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:01,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:01,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143483908] [2021-12-15 17:07:01,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143483908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:01,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:01,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:01,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102163566] [2021-12-15 17:07:01,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:01,077 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:01,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:01,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:01,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:01,078 INFO L87 Difference]: Start difference. First operand 722 states and 1138 transitions. cyclomatic complexity: 432 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:01,103 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2021-12-15 17:07:01,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:01,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2226 transitions. [2021-12-15 17:07:01,117 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-12-15 17:07:01,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2226 transitions. [2021-12-15 17:07:01,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2021-12-15 17:07:01,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2021-12-15 17:07:01,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2226 transitions. [2021-12-15 17:07:01,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:01,129 INFO L681 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-12-15 17:07:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2226 transitions. [2021-12-15 17:07:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2021-12-15 17:07:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5610098176718092) internal successors, (2226), 1425 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2226 transitions. [2021-12-15 17:07:01,153 INFO L704 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-12-15 17:07:01,154 INFO L587 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-12-15 17:07:01,154 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:07:01,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2226 transitions. [2021-12-15 17:07:01,160 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-12-15 17:07:01,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:01,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:01,161 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:01,161 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:01,161 INFO L791 eck$LassoCheckResult]: Stem: 4313#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(18, 2);call #Ultimate.allocInit(12, 3); 4305#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4306#L225-1 [2021-12-15 17:07:01,162 INFO L793 eck$LassoCheckResult]: Loop: 4306#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4520#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 4521#L93 assume !(0 != main_~p1~0#1); 4734#L93-2 assume !(0 != main_~p2~0#1); 4733#L97-1 assume !(0 != main_~p3~0#1); 4731#L101-1 assume !(0 != main_~p4~0#1); 4728#L105-1 assume !(0 != main_~p5~0#1); 4724#L109-1 assume !(0 != main_~p6~0#1); 4722#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4720#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4718#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4716#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4714#L129-1 assume !(0 != main_~p11~0#1); 4712#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4710#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4708#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4706#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4703#L149-1 assume !(0 != main_~p1~0#1); 4704#L155-1 assume !(0 != main_~p2~0#1); 4753#L160-1 assume !(0 != main_~p3~0#1); 4654#L165-1 assume !(0 != main_~p4~0#1); 4655#L170-1 assume !(0 != main_~p5~0#1); 4643#L175-1 assume !(0 != main_~p6~0#1); 4645#L180-1 assume !(0 != main_~p7~0#1); 4627#L185-1 assume !(0 != main_~p8~0#1); 4628#L190-1 assume !(0 != main_~p9~0#1); 4612#L195-1 assume !(0 != main_~p10~0#1); 4611#L200-1 assume !(0 != main_~p11~0#1); 4595#L205-1 assume !(0 != main_~p12~0#1); 4587#L210-1 assume !(0 != main_~p13~0#1); 4586#L215-1 assume !(0 != main_~p14~0#1); 4540#L220-1 assume !(0 != main_~p15~0#1); 4306#L225-1 [2021-12-15 17:07:01,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,162 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-15 17:07:01,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971811335] [2021-12-15 17:07:01,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,173 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,183 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:01,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1304237704, now seen corresponding path program 1 times [2021-12-15 17:07:01,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39411223] [2021-12-15 17:07:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:01,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:01,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39411223] [2021-12-15 17:07:01,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39411223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:01,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:01,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:01,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940569168] [2021-12-15 17:07:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:01,228 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:01,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:01,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:01,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:01,229 INFO L87 Difference]: Start difference. First operand 1426 states and 2226 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:01,251 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2021-12-15 17:07:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:01,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4354 transitions. [2021-12-15 17:07:01,278 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-12-15 17:07:01,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4354 transitions. [2021-12-15 17:07:01,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2021-12-15 17:07:01,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2021-12-15 17:07:01,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4354 transitions. [2021-12-15 17:07:01,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:01,295 INFO L681 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-12-15 17:07:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4354 transitions. [2021-12-15 17:07:01,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2021-12-15 17:07:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.5450674237047552) internal successors, (4354), 2817 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4354 transitions. [2021-12-15 17:07:01,357 INFO L704 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-12-15 17:07:01,358 INFO L587 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-12-15 17:07:01,360 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:07:01,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4354 transitions. [2021-12-15 17:07:01,375 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-12-15 17:07:01,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:01,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:01,378 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:01,378 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:01,379 INFO L791 eck$LassoCheckResult]: Stem: 8576#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(18, 2);call #Ultimate.allocInit(12, 3); 8562#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8563#L225-1 [2021-12-15 17:07:01,379 INFO L793 eck$LassoCheckResult]: Loop: 8563#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8727#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 8725#L93 assume !(0 != main_~p1~0#1); 8724#L93-2 assume !(0 != main_~p2~0#1); 8718#L97-1 assume !(0 != main_~p3~0#1); 8719#L101-1 assume !(0 != main_~p4~0#1); 8825#L105-1 assume !(0 != main_~p5~0#1); 8822#L109-1 assume !(0 != main_~p6~0#1); 8818#L113-1 assume !(0 != main_~p7~0#1); 8816#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8815#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8812#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8809#L129-1 assume !(0 != main_~p11~0#1); 8806#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8802#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8798#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8793#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8787#L149-1 assume !(0 != main_~p1~0#1); 8781#L155-1 assume !(0 != main_~p2~0#1); 8776#L160-1 assume !(0 != main_~p3~0#1); 8769#L165-1 assume !(0 != main_~p4~0#1); 8763#L170-1 assume !(0 != main_~p5~0#1); 8758#L175-1 assume !(0 != main_~p6~0#1); 8756#L180-1 assume !(0 != main_~p7~0#1); 8750#L185-1 assume !(0 != main_~p8~0#1); 8747#L190-1 assume !(0 != main_~p9~0#1); 8743#L195-1 assume !(0 != main_~p10~0#1); 8737#L200-1 assume !(0 != main_~p11~0#1); 8735#L205-1 assume !(0 != main_~p12~0#1); 8733#L210-1 assume !(0 != main_~p13~0#1); 8731#L215-1 assume !(0 != main_~p14~0#1); 8729#L220-1 assume !(0 != main_~p15~0#1); 8563#L225-1 [2021-12-15 17:07:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-15 17:07:01,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005812676] [2021-12-15 17:07:01,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,397 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1170224198, now seen corresponding path program 1 times [2021-12-15 17:07:01,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833555342] [2021-12-15 17:07:01,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:01,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:01,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833555342] [2021-12-15 17:07:01,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833555342] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:01,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:01,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:01,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645169332] [2021-12-15 17:07:01,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:01,420 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:01,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:01,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:01,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:01,421 INFO L87 Difference]: Start difference. First operand 2818 states and 4354 transitions. cyclomatic complexity: 1600 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:01,453 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2021-12-15 17:07:01,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:01,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8514 transitions. [2021-12-15 17:07:01,497 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-12-15 17:07:01,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8514 transitions. [2021-12-15 17:07:01,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2021-12-15 17:07:01,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2021-12-15 17:07:01,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8514 transitions. [2021-12-15 17:07:01,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:01,543 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-12-15 17:07:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8514 transitions. [2021-12-15 17:07:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2021-12-15 17:07:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.5285457809694794) internal successors, (8514), 5569 states have internal predecessors, (8514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8514 transitions. [2021-12-15 17:07:01,674 INFO L704 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-12-15 17:07:01,674 INFO L587 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-12-15 17:07:01,674 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:07:01,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8514 transitions. [2021-12-15 17:07:01,701 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-12-15 17:07:01,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:01,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:01,703 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:01,703 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:01,703 INFO L791 eck$LassoCheckResult]: Stem: 16963#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(18, 2);call #Ultimate.allocInit(12, 3); 16949#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16950#L225-1 [2021-12-15 17:07:01,704 INFO L793 eck$LassoCheckResult]: Loop: 16950#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17206#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 17200#L93 assume !(0 != main_~p1~0#1); 17196#L93-2 assume !(0 != main_~p2~0#1); 17193#L97-1 assume !(0 != main_~p3~0#1); 17187#L101-1 assume !(0 != main_~p4~0#1); 17181#L105-1 assume !(0 != main_~p5~0#1); 17177#L109-1 assume !(0 != main_~p6~0#1); 17172#L113-1 assume !(0 != main_~p7~0#1); 17166#L117-1 assume !(0 != main_~p8~0#1); 17167#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 17154#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17155#L129-1 assume !(0 != main_~p11~0#1); 17146#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17147#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17138#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17139#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17128#L149-1 assume !(0 != main_~p1~0#1); 17129#L155-1 assume !(0 != main_~p2~0#1); 17118#L160-1 assume !(0 != main_~p3~0#1); 17117#L165-1 assume !(0 != main_~p4~0#1); 17104#L170-1 assume !(0 != main_~p5~0#1); 17105#L175-1 assume !(0 != main_~p6~0#1); 17095#L180-1 assume !(0 != main_~p7~0#1); 17096#L185-1 assume !(0 != main_~p8~0#1); 17248#L190-1 assume !(0 != main_~p9~0#1); 17244#L195-1 assume !(0 != main_~p10~0#1); 17240#L200-1 assume !(0 != main_~p11~0#1); 17234#L205-1 assume !(0 != main_~p12~0#1); 17228#L210-1 assume !(0 != main_~p13~0#1); 17222#L215-1 assume !(0 != main_~p14~0#1); 17216#L220-1 assume !(0 != main_~p15~0#1); 16950#L225-1 [2021-12-15 17:07:01,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-15 17:07:01,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727876907] [2021-12-15 17:07:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,720 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,724 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:01,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,724 INFO L85 PathProgramCache]: Analyzing trace with hash -635214136, now seen corresponding path program 1 times [2021-12-15 17:07:01,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299622416] [2021-12-15 17:07:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:01,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:01,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299622416] [2021-12-15 17:07:01,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299622416] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:01,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:01,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:01,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521674093] [2021-12-15 17:07:01,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:01,770 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:01,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:01,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:01,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:01,771 INFO L87 Difference]: Start difference. First operand 5570 states and 8514 transitions. cyclomatic complexity: 3072 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:01,823 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2021-12-15 17:07:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:01,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16642 transitions. [2021-12-15 17:07:01,936 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-12-15 17:07:01,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16642 transitions. [2021-12-15 17:07:01,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2021-12-15 17:07:01,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2021-12-15 17:07:01,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16642 transitions. [2021-12-15 17:07:02,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:02,006 INFO L681 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-12-15 17:07:02,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16642 transitions. [2021-12-15 17:07:02,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2021-12-15 17:07:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.5115349682107175) internal successors, (16642), 11009 states have internal predecessors, (16642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16642 transitions. [2021-12-15 17:07:02,223 INFO L704 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-12-15 17:07:02,223 INFO L587 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-12-15 17:07:02,224 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:07:02,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16642 transitions. [2021-12-15 17:07:02,306 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-12-15 17:07:02,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:02,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:02,308 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:02,309 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:02,309 INFO L791 eck$LassoCheckResult]: Stem: 33547#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(18, 2);call #Ultimate.allocInit(12, 3); 33535#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33536#L225-1 [2021-12-15 17:07:02,310 INFO L793 eck$LassoCheckResult]: Loop: 33536#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 34190#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 34191#L93 assume !(0 != main_~p1~0#1); 34313#L93-2 assume !(0 != main_~p2~0#1); 34311#L97-1 assume !(0 != main_~p3~0#1); 34307#L101-1 assume !(0 != main_~p4~0#1); 34304#L105-1 assume !(0 != main_~p5~0#1); 34302#L109-1 assume !(0 != main_~p6~0#1); 34298#L113-1 assume !(0 != main_~p7~0#1); 34294#L117-1 assume !(0 != main_~p8~0#1); 34290#L121-1 assume !(0 != main_~p9~0#1); 34288#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 34286#L129-1 assume !(0 != main_~p11~0#1); 34284#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 34282#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 34280#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 34278#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 34274#L149-1 assume !(0 != main_~p1~0#1); 34270#L155-1 assume !(0 != main_~p2~0#1); 34267#L160-1 assume !(0 != main_~p3~0#1); 34262#L165-1 assume !(0 != main_~p4~0#1); 34258#L170-1 assume !(0 != main_~p5~0#1); 34256#L175-1 assume !(0 != main_~p6~0#1); 34233#L180-1 assume !(0 != main_~p7~0#1); 34234#L185-1 assume !(0 != main_~p8~0#1); 34227#L190-1 assume !(0 != main_~p9~0#1); 34229#L195-1 assume !(0 != main_~p10~0#1); 34223#L200-1 assume !(0 != main_~p11~0#1); 34222#L205-1 assume !(0 != main_~p12~0#1); 34217#L210-1 assume !(0 != main_~p13~0#1); 34216#L215-1 assume !(0 != main_~p14~0#1); 34208#L220-1 assume !(0 != main_~p15~0#1); 33536#L225-1 [2021-12-15 17:07:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:02,311 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-12-15 17:07:02,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:02,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641036529] [2021-12-15 17:07:02,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:02,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:02,322 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:02,332 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:02,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:02,333 INFO L85 PathProgramCache]: Analyzing trace with hash -416359418, now seen corresponding path program 1 times [2021-12-15 17:07:02,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:02,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168264465] [2021-12-15 17:07:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:02,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:02,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:02,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168264465] [2021-12-15 17:07:02,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168264465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:02,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:02,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:02,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417269578] [2021-12-15 17:07:02,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:02,371 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:02,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:02,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:02,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:02,372 INFO L87 Difference]: Start difference. First operand 11010 states and 16642 transitions. cyclomatic complexity: 5888 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:02,436 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2021-12-15 17:07:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:02,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 32514 transitions. [2021-12-15 17:07:02,611 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-12-15 17:07:02,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 32514 transitions. [2021-12-15 17:07:02,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2021-12-15 17:07:02,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2021-12-15 17:07:02,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 32514 transitions. [2021-12-15 17:07:02,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:02,720 INFO L681 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-12-15 17:07:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 32514 transitions. [2021-12-15 17:07:03,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2021-12-15 17:07:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.4940722360077199) internal successors, (32514), 21761 states have internal predecessors, (32514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 32514 transitions. [2021-12-15 17:07:03,188 INFO L704 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-12-15 17:07:03,188 INFO L587 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-12-15 17:07:03,188 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:07:03,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 32514 transitions. [2021-12-15 17:07:03,330 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-12-15 17:07:03,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:03,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:03,331 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:03,331 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:03,331 INFO L791 eck$LassoCheckResult]: Stem: 66322#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(18, 2);call #Ultimate.allocInit(12, 3); 66310#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66311#L225-1 [2021-12-15 17:07:03,331 INFO L793 eck$LassoCheckResult]: Loop: 66311#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66629#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 66630#L93 assume !(0 != main_~p1~0#1); 66617#L93-2 assume !(0 != main_~p2~0#1); 66619#L97-1 assume !(0 != main_~p3~0#1); 66606#L101-1 assume !(0 != main_~p4~0#1); 66608#L105-1 assume !(0 != main_~p5~0#1); 66710#L109-1 assume !(0 != main_~p6~0#1); 66708#L113-1 assume !(0 != main_~p7~0#1); 66705#L117-1 assume !(0 != main_~p8~0#1); 66702#L121-1 assume !(0 != main_~p9~0#1); 66700#L125-1 assume !(0 != main_~p10~0#1); 66699#L129-1 assume !(0 != main_~p11~0#1); 66698#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 66697#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66696#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66694#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66691#L149-1 assume !(0 != main_~p1~0#1); 66688#L155-1 assume !(0 != main_~p2~0#1); 66686#L160-1 assume !(0 != main_~p3~0#1); 66530#L165-1 assume !(0 != main_~p4~0#1); 66531#L170-1 assume !(0 != main_~p5~0#1); 66516#L175-1 assume !(0 != main_~p6~0#1); 66517#L180-1 assume !(0 != main_~p7~0#1); 66683#L185-1 assume !(0 != main_~p8~0#1); 66671#L190-1 assume !(0 != main_~p9~0#1); 66673#L195-1 assume !(0 != main_~p10~0#1); 66661#L200-1 assume !(0 != main_~p11~0#1); 66660#L205-1 assume !(0 != main_~p12~0#1); 66651#L210-1 assume !(0 != main_~p13~0#1); 66650#L215-1 assume !(0 != main_~p14~0#1); 66639#L220-1 assume !(0 != main_~p15~0#1); 66311#L225-1 [2021-12-15 17:07:03,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:03,332 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-12-15 17:07:03,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:03,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066524928] [2021-12-15 17:07:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:03,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:03,339 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:03,345 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:03,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash 6342408, now seen corresponding path program 1 times [2021-12-15 17:07:03,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:03,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155395163] [2021-12-15 17:07:03,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:03,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:03,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:03,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155395163] [2021-12-15 17:07:03,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155395163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:03,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:03,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:03,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729897090] [2021-12-15 17:07:03,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:03,380 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:03,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:03,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:03,382 INFO L87 Difference]: Start difference. First operand 21762 states and 32514 transitions. cyclomatic complexity: 11264 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:03,617 INFO L93 Difference]: Finished difference Result 43010 states and 63490 transitions. [2021-12-15 17:07:03,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:03,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 63490 transitions. [2021-12-15 17:07:03,832 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-12-15 17:07:03,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 63490 transitions. [2021-12-15 17:07:03,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2021-12-15 17:07:03,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2021-12-15 17:07:03,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 63490 transitions. [2021-12-15 17:07:04,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:04,011 INFO L681 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-12-15 17:07:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 63490 transitions. [2021-12-15 17:07:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2021-12-15 17:07:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4761683329458266) internal successors, (63490), 43009 states have internal predecessors, (63490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 63490 transitions. [2021-12-15 17:07:04,680 INFO L704 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-12-15 17:07:04,680 INFO L587 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-12-15 17:07:04,681 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:07:04,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 63490 transitions. [2021-12-15 17:07:04,801 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-12-15 17:07:04,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:04,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:04,802 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:04,802 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:04,803 INFO L791 eck$LassoCheckResult]: Stem: 131098#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(18, 2);call #Ultimate.allocInit(12, 3); 131087#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131088#L225-1 [2021-12-15 17:07:04,803 INFO L793 eck$LassoCheckResult]: Loop: 131088#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 131568#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 131565#L93 assume !(0 != main_~p1~0#1); 131561#L93-2 assume !(0 != main_~p2~0#1); 131558#L97-1 assume !(0 != main_~p3~0#1); 131547#L101-1 assume !(0 != main_~p4~0#1); 131536#L105-1 assume !(0 != main_~p5~0#1); 131527#L109-1 assume !(0 != main_~p6~0#1); 131517#L113-1 assume !(0 != main_~p7~0#1); 131511#L117-1 assume !(0 != main_~p8~0#1); 131505#L121-1 assume !(0 != main_~p9~0#1); 131498#L125-1 assume !(0 != main_~p10~0#1); 131493#L129-1 assume !(0 != main_~p11~0#1); 131423#L133-1 assume !(0 != main_~p12~0#1); 131424#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 131409#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 131410#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 131392#L149-1 assume !(0 != main_~p1~0#1); 131393#L155-1 assume !(0 != main_~p2~0#1); 131373#L160-1 assume !(0 != main_~p3~0#1); 131372#L165-1 assume !(0 != main_~p4~0#1); 131349#L170-1 assume !(0 != main_~p5~0#1); 131350#L175-1 assume !(0 != main_~p6~0#1); 131327#L180-1 assume !(0 != main_~p7~0#1); 131328#L185-1 assume !(0 != main_~p8~0#1); 131309#L190-1 assume !(0 != main_~p9~0#1); 131311#L195-1 assume !(0 != main_~p10~0#1); 131469#L200-1 assume !(0 != main_~p11~0#1); 131464#L205-1 assume !(0 != main_~p12~0#1); 131465#L210-1 assume !(0 != main_~p13~0#1); 131576#L215-1 assume !(0 != main_~p14~0#1); 131573#L220-1 assume !(0 != main_~p15~0#1); 131088#L225-1 [2021-12-15 17:07:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-12-15 17:07:04,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308601856] [2021-12-15 17:07:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,810 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:04,813 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:04,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1682601334, now seen corresponding path program 1 times [2021-12-15 17:07:04,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:04,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623412773] [2021-12-15 17:07:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:04,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:04,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:04,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623412773] [2021-12-15 17:07:04,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623412773] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:04,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:04,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:04,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719312237] [2021-12-15 17:07:04,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:04,830 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:04,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:04,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:04,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:04,831 INFO L87 Difference]: Start difference. First operand 43010 states and 63490 transitions. cyclomatic complexity: 21504 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:05,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:05,175 INFO L93 Difference]: Finished difference Result 84994 states and 123906 transitions. [2021-12-15 17:07:05,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:05,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 123906 transitions. [2021-12-15 17:07:05,706 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-12-15 17:07:05,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 123906 transitions. [2021-12-15 17:07:05,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2021-12-15 17:07:05,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2021-12-15 17:07:05,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 123906 transitions. [2021-12-15 17:07:06,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:06,053 INFO L681 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-12-15 17:07:06,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 123906 transitions. [2021-12-15 17:07:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2021-12-15 17:07:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.4578205520389675) internal successors, (123906), 84993 states have internal predecessors, (123906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 123906 transitions. [2021-12-15 17:07:07,359 INFO L704 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-12-15 17:07:07,359 INFO L587 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-12-15 17:07:07,359 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-15 17:07:07,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 123906 transitions. [2021-12-15 17:07:07,576 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-12-15 17:07:07,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:07,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:07,578 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:07,578 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:07,578 INFO L791 eck$LassoCheckResult]: Stem: 259116#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(18, 2);call #Ultimate.allocInit(12, 3); 259105#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259106#L225-1 [2021-12-15 17:07:07,578 INFO L793 eck$LassoCheckResult]: Loop: 259106#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 260093#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 260071#L93 assume !(0 != main_~p1~0#1); 260073#L93-2 assume !(0 != main_~p2~0#1); 260053#L97-1 assume !(0 != main_~p3~0#1); 260054#L101-1 assume !(0 != main_~p4~0#1); 260027#L105-1 assume !(0 != main_~p5~0#1); 260029#L109-1 assume !(0 != main_~p6~0#1); 260313#L113-1 assume !(0 != main_~p7~0#1); 260283#L117-1 assume !(0 != main_~p8~0#1); 260285#L121-1 assume !(0 != main_~p9~0#1); 260309#L125-1 assume !(0 != main_~p10~0#1); 260308#L129-1 assume !(0 != main_~p11~0#1); 260306#L133-1 assume !(0 != main_~p12~0#1); 260304#L137-1 assume !(0 != main_~p13~0#1); 260302#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 260300#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 260297#L149-1 assume !(0 != main_~p1~0#1); 260293#L155-1 assume !(0 != main_~p2~0#1); 260290#L160-1 assume !(0 != main_~p3~0#1); 260225#L165-1 assume !(0 != main_~p4~0#1); 260226#L170-1 assume !(0 != main_~p5~0#1); 260202#L175-1 assume !(0 != main_~p6~0#1); 260204#L180-1 assume !(0 != main_~p7~0#1); 260181#L185-1 assume !(0 != main_~p8~0#1); 260182#L190-1 assume !(0 != main_~p9~0#1); 260176#L195-1 assume !(0 != main_~p10~0#1); 260178#L200-1 assume !(0 != main_~p11~0#1); 260125#L205-1 assume !(0 != main_~p12~0#1); 260127#L210-1 assume !(0 != main_~p13~0#1); 260112#L215-1 assume !(0 != main_~p14~0#1); 260111#L220-1 assume !(0 != main_~p15~0#1); 259106#L225-1 [2021-12-15 17:07:07,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-12-15 17:07:07,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:07,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239406539] [2021-12-15 17:07:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:07,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:07,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:07,591 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:07,591 INFO L85 PathProgramCache]: Analyzing trace with hash 618221256, now seen corresponding path program 1 times [2021-12-15 17:07:07,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:07,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696618203] [2021-12-15 17:07:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:07,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:07,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:07,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696618203] [2021-12-15 17:07:07,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696618203] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:07,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:07,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:07,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998448715] [2021-12-15 17:07:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:07,607 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:07,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:07,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:07,608 INFO L87 Difference]: Start difference. First operand 84994 states and 123906 transitions. cyclomatic complexity: 40960 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:08,397 INFO L93 Difference]: Finished difference Result 167938 states and 241666 transitions. [2021-12-15 17:07:08,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:08,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167938 states and 241666 transitions. [2021-12-15 17:07:09,018 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2021-12-15 17:07:09,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167938 states to 167938 states and 241666 transitions. [2021-12-15 17:07:09,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167938 [2021-12-15 17:07:09,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167938 [2021-12-15 17:07:09,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167938 states and 241666 transitions. [2021-12-15 17:07:09,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:09,958 INFO L681 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-12-15 17:07:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167938 states and 241666 transitions. [2021-12-15 17:07:11,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167938 to 167938. [2021-12-15 17:07:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167938 states, 167938 states have (on average 1.4390191618335337) internal successors, (241666), 167937 states have internal predecessors, (241666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167938 states to 167938 states and 241666 transitions. [2021-12-15 17:07:12,047 INFO L704 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-12-15 17:07:12,047 INFO L587 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-12-15 17:07:12,047 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-15 17:07:12,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167938 states and 241666 transitions. [2021-12-15 17:07:12,842 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2021-12-15 17:07:12,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:12,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:12,845 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:12,845 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:12,845 INFO L791 eck$LassoCheckResult]: Stem: 512052#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(18, 2);call #Ultimate.allocInit(12, 3); 512037#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 512038#L225-1 [2021-12-15 17:07:12,845 INFO L793 eck$LassoCheckResult]: Loop: 512038#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 512371#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 512369#L93 assume !(0 != main_~p1~0#1); 512367#L93-2 assume !(0 != main_~p2~0#1); 512366#L97-1 assume !(0 != main_~p3~0#1); 512364#L101-1 assume !(0 != main_~p4~0#1); 512362#L105-1 assume !(0 != main_~p5~0#1); 512360#L109-1 assume !(0 != main_~p6~0#1); 512358#L113-1 assume !(0 != main_~p7~0#1); 512356#L117-1 assume !(0 != main_~p8~0#1); 512354#L121-1 assume !(0 != main_~p9~0#1); 512352#L125-1 assume !(0 != main_~p10~0#1); 512351#L129-1 assume !(0 != main_~p11~0#1); 512349#L133-1 assume !(0 != main_~p12~0#1); 512345#L137-1 assume !(0 != main_~p13~0#1); 512343#L141-1 assume !(0 != main_~p14~0#1); 512340#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 512336#L149-1 assume !(0 != main_~p1~0#1); 512330#L155-1 assume !(0 != main_~p2~0#1); 512325#L160-1 assume !(0 != main_~p3~0#1); 512318#L165-1 assume !(0 != main_~p4~0#1); 512312#L170-1 assume !(0 != main_~p5~0#1); 512306#L175-1 assume !(0 != main_~p6~0#1); 512300#L180-1 assume !(0 != main_~p7~0#1); 512294#L185-1 assume !(0 != main_~p8~0#1); 512288#L190-1 assume !(0 != main_~p9~0#1); 512282#L195-1 assume !(0 != main_~p10~0#1); 512277#L200-1 assume !(0 != main_~p11~0#1); 512270#L205-1 assume !(0 != main_~p12~0#1); 512261#L210-1 assume !(0 != main_~p13~0#1); 512262#L215-1 assume !(0 != main_~p14~0#1); 512373#L220-1 assume !(0 != main_~p15~0#1); 512038#L225-1 [2021-12-15 17:07:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2021-12-15 17:07:12,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:12,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372640591] [2021-12-15 17:07:12,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:12,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:12,849 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:12,858 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:12,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash -970126646, now seen corresponding path program 1 times [2021-12-15 17:07:12,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:12,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213863640] [2021-12-15 17:07:12,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:12,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:12,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:12,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213863640] [2021-12-15 17:07:12,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213863640] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:12,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:12,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:07:12,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076594257] [2021-12-15 17:07:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:12,888 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:12,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:12,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:12,889 INFO L87 Difference]: Start difference. First operand 167938 states and 241666 transitions. cyclomatic complexity: 77824 Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:13,754 INFO L93 Difference]: Finished difference Result 331778 states and 471042 transitions. [2021-12-15 17:07:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:13,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331778 states and 471042 transitions. [2021-12-15 17:07:15,587 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2021-12-15 17:07:16,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331778 states to 331778 states and 471042 transitions. [2021-12-15 17:07:16,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331778 [2021-12-15 17:07:16,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331778 [2021-12-15 17:07:16,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331778 states and 471042 transitions. [2021-12-15 17:07:16,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:16,975 INFO L681 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-12-15 17:07:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331778 states and 471042 transitions. [2021-12-15 17:07:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331778 to 331778. [2021-12-15 17:07:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331778 states, 331778 states have (on average 1.419750556094738) internal successors, (471042), 331777 states have internal predecessors, (471042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331778 states to 331778 states and 471042 transitions. [2021-12-15 17:07:20,989 INFO L704 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-12-15 17:07:20,989 INFO L587 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-12-15 17:07:20,989 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-15 17:07:20,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331778 states and 471042 transitions. [2021-12-15 17:07:22,582 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2021-12-15 17:07:22,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:22,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:22,586 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:22,586 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:22,586 INFO L791 eck$LassoCheckResult]: Stem: 1011773#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(18, 2);call #Ultimate.allocInit(12, 3); 1011759#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_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1011760#L225-1 [2021-12-15 17:07:22,586 INFO L793 eck$LassoCheckResult]: Loop: 1011760#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1012553#L58 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;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1012551#L93 assume !(0 != main_~p1~0#1); 1012549#L93-2 assume !(0 != main_~p2~0#1); 1012548#L97-1 assume !(0 != main_~p3~0#1); 1012546#L101-1 assume !(0 != main_~p4~0#1); 1012544#L105-1 assume !(0 != main_~p5~0#1); 1012545#L109-1 assume !(0 != main_~p6~0#1); 1012707#L113-1 assume !(0 != main_~p7~0#1); 1012702#L117-1 assume !(0 != main_~p8~0#1); 1012697#L121-1 assume !(0 != main_~p9~0#1); 1012691#L125-1 assume !(0 != main_~p10~0#1); 1012687#L129-1 assume !(0 != main_~p11~0#1); 1012683#L133-1 assume !(0 != main_~p12~0#1); 1012678#L137-1 assume !(0 != main_~p13~0#1); 1012674#L141-1 assume !(0 != main_~p14~0#1); 1012668#L145-1 assume !(0 != main_~p15~0#1); 1012661#L149-1 assume !(0 != main_~p1~0#1); 1012653#L155-1 assume !(0 != main_~p2~0#1); 1012642#L160-1 assume !(0 != main_~p3~0#1); 1012638#L165-1 assume !(0 != main_~p4~0#1); 1012636#L170-1 assume !(0 != main_~p5~0#1); 1012632#L175-1 assume !(0 != main_~p6~0#1); 1012628#L180-1 assume !(0 != main_~p7~0#1); 1012624#L185-1 assume !(0 != main_~p8~0#1); 1012620#L190-1 assume !(0 != main_~p9~0#1); 1012616#L195-1 assume !(0 != main_~p10~0#1); 1012570#L200-1 assume !(0 != main_~p11~0#1); 1012560#L205-1 assume !(0 != main_~p12~0#1); 1012558#L210-1 assume !(0 != main_~p13~0#1); 1012556#L215-1 assume !(0 != main_~p14~0#1); 1012554#L220-1 assume !(0 != main_~p15~0#1); 1011760#L225-1 [2021-12-15 17:07:22,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:22,587 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2021-12-15 17:07:22,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:22,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740207170] [2021-12-15 17:07:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:22,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:22,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:22,593 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1991195000, now seen corresponding path program 1 times [2021-12-15 17:07:22,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:22,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826183083] [2021-12-15 17:07:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:22,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:22,597 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:22,608 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:22,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1845576266, now seen corresponding path program 1 times [2021-12-15 17:07:22,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:22,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338865484] [2021-12-15 17:07:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:22,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:22,613 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:22,620 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:22,928 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:855) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:07:22,931 INFO L158 Benchmark]: Toolchain (without parser) took 23383.01ms. Allocated memory was 113.2MB in the beginning and 13.5GB in the end (delta: 13.4GB). Free memory was 89.8MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2021-12-15 17:07:22,932 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:07:22,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.75ms. Allocated memory is still 113.2MB. Free memory was 89.5MB in the beginning and 88.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:07:22,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.64ms. Allocated memory is still 113.2MB. Free memory was 88.1MB in the beginning and 86.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:07:22,934 INFO L158 Benchmark]: Boogie Preprocessor took 51.14ms. Allocated memory is still 113.2MB. Free memory was 86.4MB in the beginning and 84.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:07:22,934 INFO L158 Benchmark]: RCFGBuilder took 313.21ms. Allocated memory is still 113.2MB. Free memory was 84.9MB in the beginning and 72.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 17:07:22,934 INFO L158 Benchmark]: BuchiAutomizer took 22729.97ms. Allocated memory was 113.2MB in the beginning and 13.5GB in the end (delta: 13.4GB). Free memory was 72.1MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2021-12-15 17:07:22,936 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.16ms. Allocated memory is still 94.4MB. Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.75ms. Allocated memory is still 113.2MB. Free memory was 89.5MB in the beginning and 88.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.64ms. Allocated memory is still 113.2MB. Free memory was 88.1MB in the beginning and 86.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.14ms. Allocated memory is still 113.2MB. Free memory was 86.4MB in the beginning and 84.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 313.21ms. Allocated memory is still 113.2MB. Free memory was 84.9MB in the beginning and 72.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 22729.97ms. Allocated memory was 113.2MB in the beginning and 13.5GB in the end (delta: 13.4GB). Free memory was 72.1MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:07:22,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable