./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-dev-03d7b7b [2022-02-21 03:39:54,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:39:54,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:39:54,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:39:54,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:39:54,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:39:54,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:39:54,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:39:54,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:39:54,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:39:54,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:39:54,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:39:54,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:39:54,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:39:54,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:39:54,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:39:54,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:39:54,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:39:54,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:39:54,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:39:54,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:39:54,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:39:54,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:39:54,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:39:54,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:39:54,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:39:54,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:39:54,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:39:54,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:39:54,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:39:54,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:39:54,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:39:54,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:39:54,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:39:54,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:39:54,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:39:54,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:39:54,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:39:54,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:39:54,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:39:54,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:39:54,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:39:54,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:39:54,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:39:54,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:39:54,982 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:39:54,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:39:54,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:39:54,984 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:39:54,984 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:39:54,985 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:39:54,985 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:39:54,986 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:39:54,986 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:39:54,986 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:39:54,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:39:54,986 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:39:54,986 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:39:54,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:39:54,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:39:54,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:39:54,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:39:54,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:39:54,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:39:54,988 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:39:54,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:39:54,988 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:39:54,988 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:39:54,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:39:54,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:39:54,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:39:54,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:39:54,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:39:54,990 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:39:54,990 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 [2022-02-21 03:39:55,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:39:55,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:39:55,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:39:55,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:39:55,228 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:39:55,229 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 [2022-02-21 03:39:55,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af02ec979/ec0fc446d5954f939b015f9dc7d1e3dc/FLAG99f8c3aed [2022-02-21 03:39:55,640 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:39:55,640 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2022-02-21 03:39:55,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af02ec979/ec0fc446d5954f939b015f9dc7d1e3dc/FLAG99f8c3aed [2022-02-21 03:39:56,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af02ec979/ec0fc446d5954f939b015f9dc7d1e3dc [2022-02-21 03:39:56,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:39:56,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:39:56,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:56,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:39:56,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:39:56,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1e44cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56, skipping insertion in model container [2022-02-21 03:39:56,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:39:56,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:39:56,338 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] [2022-02-21 03:39:56,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:56,347 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:39:56,377 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] [2022-02-21 03:39:56,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:56,389 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:39:56,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56 WrapperNode [2022-02-21 03:39:56,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:56,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:56,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:39:56,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:39:56,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,445 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 177 [2022-02-21 03:39:56,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:56,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:39:56,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:39:56,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:39:56,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:39:56,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:39:56,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:39:56,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:39:56,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56" (1/1) ... [2022-02-21 03:39:56,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:39:56,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:39:56,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:39:56,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:39:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:39:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:39:56,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:39:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:39:56,582 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:39:56,583 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:39:56,737 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:39:56,742 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:39:56,743 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:39:56,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:56 BoogieIcfgContainer [2022-02-21 03:39:56,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:39:56,745 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:39:56,745 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:39:56,748 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:39:56,749 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:56,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:39:56" (1/3) ... [2022-02-21 03:39:56,750 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@109fa6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:56, skipping insertion in model container [2022-02-21 03:39:56,750 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:56,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:56" (2/3) ... [2022-02-21 03:39:56,750 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@109fa6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:56, skipping insertion in model container [2022-02-21 03:39:56,750 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:56,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:56" (3/3) ... [2022-02-21 03:39:56,751 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2022-02-21 03:39:56,801 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:39:56,819 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:39:56,819 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:39:56,819 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:39:56,820 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:39:56,820 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:39:56,820 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:39:56,820 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:39:56,845 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) [2022-02-21 03:39:56,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-02-21 03:39:56,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:56,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:56,888 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:56,889 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] [2022-02-21 03:39:56,889 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:39:56,890 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) [2022-02-21 03:39:56,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-02-21 03:39:56,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:56,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:56,899 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:56,899 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] [2022-02-21 03:39:56,911 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 [2022-02-21 03:39:56,914 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 [2022-02-21 03:39:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:56,930 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:39:56,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:56,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974648118] [2022-02-21 03:39:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:56,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:57,011 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:57,048 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2064553094, now seen corresponding path program 1 times [2022-02-21 03:39:57,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:57,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123958326] [2022-02-21 03:39:57,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:57,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:57,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {60#true} is VALID [2022-02-21 03:39:57,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} 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; {60#true} is VALID [2022-02-21 03:39:57,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:57,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {62#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {61#false} is VALID [2022-02-21 03:39:57,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {61#false} assume !(0 != main_~p2~0#1); {61#false} is VALID [2022-02-21 03:39:57,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {61#false} assume !(0 != main_~p3~0#1); {61#false} is VALID [2022-02-21 03:39:57,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {61#false} assume !(0 != main_~p4~0#1); {61#false} is VALID [2022-02-21 03:39:57,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {61#false} assume !(0 != main_~p5~0#1); {61#false} is VALID [2022-02-21 03:39:57,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {61#false} assume !(0 != main_~p6~0#1); {61#false} is VALID [2022-02-21 03:39:57,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {61#false} assume !(0 != main_~p7~0#1); {61#false} is VALID [2022-02-21 03:39:57,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {61#false} assume !(0 != main_~p8~0#1); {61#false} is VALID [2022-02-21 03:39:57,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {61#false} assume !(0 != main_~p9~0#1); {61#false} is VALID [2022-02-21 03:39:57,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {61#false} assume !(0 != main_~p10~0#1); {61#false} is VALID [2022-02-21 03:39:57,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {61#false} assume !(0 != main_~p11~0#1); {61#false} is VALID [2022-02-21 03:39:57,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {61#false} assume !(0 != main_~p12~0#1); {61#false} is VALID [2022-02-21 03:39:57,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {61#false} assume !(0 != main_~p13~0#1); {61#false} is VALID [2022-02-21 03:39:57,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {61#false} assume !(0 != main_~p14~0#1); {61#false} is VALID [2022-02-21 03:39:57,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {61#false} assume !(0 != main_~p15~0#1); {61#false} is VALID [2022-02-21 03:39:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:57,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:57,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123958326] [2022-02-21 03:39:57,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123958326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:57,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:57,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:57,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075971495] [2022-02-21 03:39:57,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:57,234 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:57,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:57,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:57,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:57,267 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) [2022-02-21 03:39:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,479 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2022-02-21 03:39:57,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:57,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:39:57,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:57,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2022-02-21 03:39:57,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2022-02-21 03:39:57,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 153 transitions. [2022-02-21 03:39:57,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-02-21 03:39:57,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-02-21 03:39:57,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 153 transitions. [2022-02-21 03:39:57,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:57,529 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2022-02-21 03:39:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 153 transitions. [2022-02-21 03:39:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-21 03:39:57,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:57,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states and 153 transitions. Second 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) [2022-02-21 03:39:57,555 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states and 153 transitions. Second 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) [2022-02-21 03:39:57,557 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. Second 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) [2022-02-21 03:39:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,561 INFO L93 Difference]: Finished difference Result 95 states and 153 transitions. [2022-02-21 03:39:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 153 transitions. [2022-02-21 03:39:57,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:57,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:57,564 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 95 states and 153 transitions. [2022-02-21 03:39:57,564 INFO L87 Difference]: Start difference. First 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) Second operand 95 states and 153 transitions. [2022-02-21 03:39:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,568 INFO L93 Difference]: Finished difference Result 95 states and 153 transitions. [2022-02-21 03:39:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 153 transitions. [2022-02-21 03:39:57,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:57,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:57,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:57,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:57,571 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) [2022-02-21 03:39:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2022-02-21 03:39:57,575 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2022-02-21 03:39:57,576 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2022-02-21 03:39:57,576 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:39:57,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 153 transitions. [2022-02-21 03:39:57,578 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2022-02-21 03:39:57,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:57,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:57,579 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:57,579 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] [2022-02-21 03:39:57,579 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 [2022-02-21 03:39:57,585 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 [2022-02-21 03:39:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:39:57,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:57,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801289156] [2022-02-21 03:39:57,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:57,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:57,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:57,603 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2087185348, now seen corresponding path program 1 times [2022-02-21 03:39:57,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:57,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832623724] [2022-02-21 03:39:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:57,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:57,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {458#true} is VALID [2022-02-21 03:39:57,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} 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; {458#true} is VALID [2022-02-21 03:39:57,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume !(0 != main_~p1~0#1); {458#true} is VALID [2022-02-21 03:39:57,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {458#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:57,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {459#false} is VALID [2022-02-21 03:39:57,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {459#false} assume !(0 != main_~p3~0#1); {459#false} is VALID [2022-02-21 03:39:57,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {459#false} assume !(0 != main_~p4~0#1); {459#false} is VALID [2022-02-21 03:39:57,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {459#false} assume !(0 != main_~p5~0#1); {459#false} is VALID [2022-02-21 03:39:57,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {459#false} assume !(0 != main_~p6~0#1); {459#false} is VALID [2022-02-21 03:39:57,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {459#false} assume !(0 != main_~p7~0#1); {459#false} is VALID [2022-02-21 03:39:57,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {459#false} assume !(0 != main_~p8~0#1); {459#false} is VALID [2022-02-21 03:39:57,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {459#false} assume !(0 != main_~p9~0#1); {459#false} is VALID [2022-02-21 03:39:57,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {459#false} assume !(0 != main_~p10~0#1); {459#false} is VALID [2022-02-21 03:39:57,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {459#false} assume !(0 != main_~p11~0#1); {459#false} is VALID [2022-02-21 03:39:57,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {459#false} assume !(0 != main_~p12~0#1); {459#false} is VALID [2022-02-21 03:39:57,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {459#false} assume !(0 != main_~p13~0#1); {459#false} is VALID [2022-02-21 03:39:57,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {459#false} assume !(0 != main_~p14~0#1); {459#false} is VALID [2022-02-21 03:39:57,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {459#false} assume !(0 != main_~p15~0#1); {459#false} is VALID [2022-02-21 03:39:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:57,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:57,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832623724] [2022-02-21 03:39:57,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832623724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:57,655 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:57,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:57,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94764654] [2022-02-21 03:39:57,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:57,656 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:57,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:57,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:57,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:57,657 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) [2022-02-21 03:39:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,782 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2022-02-21 03:39:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:57,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:39:57,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:57,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 298 transitions. [2022-02-21 03:39:57,821 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2022-02-21 03:39:57,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 298 transitions. [2022-02-21 03:39:57,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2022-02-21 03:39:57,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2022-02-21 03:39:57,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 298 transitions. [2022-02-21 03:39:57,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:57,830 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-02-21 03:39:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 298 transitions. [2022-02-21 03:39:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-02-21 03:39:57,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:57,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states and 298 transitions. Second 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) [2022-02-21 03:39:57,839 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states and 298 transitions. Second 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) [2022-02-21 03:39:57,840 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. Second 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) [2022-02-21 03:39:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,846 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2022-02-21 03:39:57,846 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 298 transitions. [2022-02-21 03:39:57,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:57,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:57,848 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 186 states and 298 transitions. [2022-02-21 03:39:57,849 INFO L87 Difference]: Start difference. First 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) Second operand 186 states and 298 transitions. [2022-02-21 03:39:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:57,855 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2022-02-21 03:39:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 298 transitions. [2022-02-21 03:39:57,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:57,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:57,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:57,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:57,858 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) [2022-02-21 03:39:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2022-02-21 03:39:57,864 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-02-21 03:39:57,864 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-02-21 03:39:57,864 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:39:57,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 298 transitions. [2022-02-21 03:39:57,866 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2022-02-21 03:39:57,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:57,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:57,867 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:57,867 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] [2022-02-21 03:39:57,867 INFO L791 eck$LassoCheckResult]: Stem: 693#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); 687#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; 688#L225-1 [2022-02-21 03:39:57,867 INFO L793 eck$LassoCheckResult]: Loop: 688#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 719#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; 717#L93 assume !(0 != main_~p1~0#1); 715#L93-2 assume !(0 != main_~p2~0#1); 716#L97-1 assume !(0 != main_~p3~0#1); 832#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 831#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 805#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 804#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 784#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 783#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 782#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 778#L129-1 assume !(0 != main_~p11~0#1); 775#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 766#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 765#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 764#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 760#L149-1 assume !(0 != main_~p1~0#1); 759#L155-1 assume !(0 != main_~p2~0#1); 758#L160-1 assume !(0 != main_~p3~0#1); 756#L165-1 assume !(0 != main_~p4~0#1); 749#L170-1 assume !(0 != main_~p5~0#1); 745#L175-1 assume !(0 != main_~p6~0#1); 741#L180-1 assume !(0 != main_~p7~0#1); 734#L185-1 assume !(0 != main_~p8~0#1); 733#L190-1 assume !(0 != main_~p9~0#1); 731#L195-1 assume !(0 != main_~p10~0#1); 729#L200-1 assume !(0 != main_~p11~0#1); 727#L205-1 assume !(0 != main_~p12~0#1); 725#L210-1 assume !(0 != main_~p13~0#1); 723#L215-1 assume !(0 != main_~p14~0#1); 721#L220-1 assume !(0 != main_~p15~0#1); 688#L225-1 [2022-02-21 03:39:57,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-02-21 03:39:57,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:57,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254471567] [2022-02-21 03:39:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:57,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:57,881 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash -821578554, now seen corresponding path program 1 times [2022-02-21 03:39:57,882 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:57,882 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489119150] [2022-02-21 03:39:57,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:57,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:57,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {1210#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {1210#true} is VALID [2022-02-21 03:39:57,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} 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; {1210#true} is VALID [2022-02-21 03:39:57,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume !(0 != main_~p1~0#1); {1210#true} is VALID [2022-02-21 03:39:57,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {1210#true} assume !(0 != main_~p2~0#1); {1210#true} is VALID [2022-02-21 03:39:57,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {1210#true} assume !(0 != main_~p3~0#1); {1210#true} is VALID [2022-02-21 03:39:57,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:57,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {1212#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {1211#false} is VALID [2022-02-21 03:39:57,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#false} assume !(0 != main_~p5~0#1); {1211#false} is VALID [2022-02-21 03:39:57,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {1211#false} assume !(0 != main_~p6~0#1); {1211#false} is VALID [2022-02-21 03:39:57,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {1211#false} assume !(0 != main_~p7~0#1); {1211#false} is VALID [2022-02-21 03:39:57,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {1211#false} assume !(0 != main_~p8~0#1); {1211#false} is VALID [2022-02-21 03:39:57,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {1211#false} assume !(0 != main_~p9~0#1); {1211#false} is VALID [2022-02-21 03:39:57,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {1211#false} assume !(0 != main_~p10~0#1); {1211#false} is VALID [2022-02-21 03:39:57,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {1211#false} assume !(0 != main_~p11~0#1); {1211#false} is VALID [2022-02-21 03:39:57,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {1211#false} assume !(0 != main_~p12~0#1); {1211#false} is VALID [2022-02-21 03:39:57,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {1211#false} assume !(0 != main_~p13~0#1); {1211#false} is VALID [2022-02-21 03:39:57,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {1211#false} assume !(0 != main_~p14~0#1); {1211#false} is VALID [2022-02-21 03:39:57,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {1211#false} assume !(0 != main_~p15~0#1); {1211#false} is VALID [2022-02-21 03:39:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:57,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:57,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489119150] [2022-02-21 03:39:57,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489119150] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:57,936 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:57,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:57,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003814796] [2022-02-21 03:39:57,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:57,937 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:57,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:57,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:57,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:57,939 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) [2022-02-21 03:39:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:58,043 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2022-02-21 03:39:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:58,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:39:58,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:58,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 582 transitions. [2022-02-21 03:39:58,083 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2022-02-21 03:39:58,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 582 transitions. [2022-02-21 03:39:58,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2022-02-21 03:39:58,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2022-02-21 03:39:58,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 582 transitions. [2022-02-21 03:39:58,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:58,096 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2022-02-21 03:39:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 582 transitions. [2022-02-21 03:39:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-02-21 03:39:58,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:58,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states and 582 transitions. Second 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) [2022-02-21 03:39:58,108 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states and 582 transitions. Second 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) [2022-02-21 03:39:58,108 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second 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) [2022-02-21 03:39:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:58,133 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2022-02-21 03:39:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2022-02-21 03:39:58,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:58,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:58,137 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 366 states and 582 transitions. [2022-02-21 03:39:58,138 INFO L87 Difference]: Start difference. First 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) Second operand 366 states and 582 transitions. [2022-02-21 03:39:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:58,167 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2022-02-21 03:39:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2022-02-21 03:39:58,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:58,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:58,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:58,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:58,170 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) [2022-02-21 03:39:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2022-02-21 03:39:58,182 INFO L704 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2022-02-21 03:39:58,182 INFO L587 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2022-02-21 03:39:58,182 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:39:58,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 582 transitions. [2022-02-21 03:39:58,184 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2022-02-21 03:39:58,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:58,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:58,185 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:58,185 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] [2022-02-21 03:39:58,185 INFO L791 eck$LassoCheckResult]: Stem: 1628#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); 1620#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; 1621#L225-1 [2022-02-21 03:39:58,186 INFO L793 eck$LassoCheckResult]: Loop: 1621#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1657#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; 1653#L93 assume !(0 != main_~p1~0#1); 1646#L93-2 assume !(0 != main_~p2~0#1); 1647#L97-1 assume !(0 != main_~p3~0#1); 1798#L101-1 assume !(0 != main_~p4~0#1); 1795#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1793#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1789#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1785#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1781#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1777#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1773#L129-1 assume !(0 != main_~p11~0#1); 1769#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1765#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1761#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1757#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1751#L149-1 assume !(0 != main_~p1~0#1); 1749#L155-1 assume !(0 != main_~p2~0#1); 1748#L160-1 assume !(0 != main_~p3~0#1); 1743#L165-1 assume !(0 != main_~p4~0#1); 1736#L170-1 assume !(0 != main_~p5~0#1); 1688#L175-1 assume !(0 != main_~p6~0#1); 1684#L180-1 assume !(0 != main_~p7~0#1); 1681#L185-1 assume !(0 != main_~p8~0#1); 1680#L190-1 assume !(0 != main_~p9~0#1); 1678#L195-1 assume !(0 != main_~p10~0#1); 1676#L200-1 assume !(0 != main_~p11~0#1); 1674#L205-1 assume !(0 != main_~p12~0#1); 1672#L210-1 assume !(0 != main_~p13~0#1); 1670#L215-1 assume !(0 != main_~p14~0#1); 1668#L220-1 assume !(0 != main_~p15~0#1); 1621#L225-1 [2022-02-21 03:39:58,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:58,186 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-02-21 03:39:58,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:58,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615990656] [2022-02-21 03:39:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:58,193 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:58,198 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:58,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:58,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1101649480, now seen corresponding path program 1 times [2022-02-21 03:39:58,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:58,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501437188] [2022-02-21 03:39:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:58,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {2682#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {2682#true} is VALID [2022-02-21 03:39:58,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {2682#true} 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; {2682#true} is VALID [2022-02-21 03:39:58,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {2682#true} assume !(0 != main_~p1~0#1); {2682#true} is VALID [2022-02-21 03:39:58,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {2682#true} assume !(0 != main_~p2~0#1); {2682#true} is VALID [2022-02-21 03:39:58,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {2682#true} assume !(0 != main_~p3~0#1); {2682#true} is VALID [2022-02-21 03:39:58,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {2682#true} assume !(0 != main_~p4~0#1); {2682#true} is VALID [2022-02-21 03:39:58,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {2682#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:58,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {2684#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {2683#false} is VALID [2022-02-21 03:39:58,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {2683#false} assume !(0 != main_~p6~0#1); {2683#false} is VALID [2022-02-21 03:39:58,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {2683#false} assume !(0 != main_~p7~0#1); {2683#false} is VALID [2022-02-21 03:39:58,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {2683#false} assume !(0 != main_~p8~0#1); {2683#false} is VALID [2022-02-21 03:39:58,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {2683#false} assume !(0 != main_~p9~0#1); {2683#false} is VALID [2022-02-21 03:39:58,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {2683#false} assume !(0 != main_~p10~0#1); {2683#false} is VALID [2022-02-21 03:39:58,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {2683#false} assume !(0 != main_~p11~0#1); {2683#false} is VALID [2022-02-21 03:39:58,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {2683#false} assume !(0 != main_~p12~0#1); {2683#false} is VALID [2022-02-21 03:39:58,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {2683#false} assume !(0 != main_~p13~0#1); {2683#false} is VALID [2022-02-21 03:39:58,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {2683#false} assume !(0 != main_~p14~0#1); {2683#false} is VALID [2022-02-21 03:39:58,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {2683#false} assume !(0 != main_~p15~0#1); {2683#false} is VALID [2022-02-21 03:39:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:58,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:58,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501437188] [2022-02-21 03:39:58,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501437188] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:58,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:58,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:58,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140744415] [2022-02-21 03:39:58,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:58,242 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:58,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:58,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:58,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:58,244 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) [2022-02-21 03:39:58,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:58,362 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2022-02-21 03:39:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:58,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:39:58,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:58,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1138 transitions. [2022-02-21 03:39:58,417 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2022-02-21 03:39:58,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1138 transitions. [2022-02-21 03:39:58,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2022-02-21 03:39:58,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2022-02-21 03:39:58,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1138 transitions. [2022-02-21 03:39:58,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:58,442 INFO L681 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2022-02-21 03:39:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1138 transitions. [2022-02-21 03:39:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2022-02-21 03:39:58,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:58,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 722 states and 1138 transitions. Second 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) [2022-02-21 03:39:58,462 INFO L74 IsIncluded]: Start isIncluded. First operand 722 states and 1138 transitions. Second 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) [2022-02-21 03:39:58,463 INFO L87 Difference]: Start difference. First operand 722 states and 1138 transitions. Second 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) [2022-02-21 03:39:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:58,485 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2022-02-21 03:39:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1138 transitions. [2022-02-21 03:39:58,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:58,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:58,489 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 722 states and 1138 transitions. [2022-02-21 03:39:58,491 INFO L87 Difference]: Start difference. First 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) Second operand 722 states and 1138 transitions. [2022-02-21 03:39:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:58,515 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2022-02-21 03:39:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1138 transitions. [2022-02-21 03:39:58,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:58,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:58,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:58,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:58,519 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) [2022-02-21 03:39:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1138 transitions. [2022-02-21 03:39:58,541 INFO L704 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2022-02-21 03:39:58,541 INFO L587 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2022-02-21 03:39:58,541 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:39:58,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1138 transitions. [2022-02-21 03:39:58,546 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2022-02-21 03:39:58,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:58,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:58,548 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:58,549 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] [2022-02-21 03:39:58,549 INFO L791 eck$LassoCheckResult]: Stem: 3461#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); 3449#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; 3450#L225-1 [2022-02-21 03:39:58,550 INFO L793 eck$LassoCheckResult]: Loop: 3450#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 3681#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; 3677#L93 assume !(0 != main_~p1~0#1); 3674#L93-2 assume !(0 != main_~p2~0#1); 3669#L97-1 assume !(0 != main_~p3~0#1); 3670#L101-1 assume !(0 != main_~p4~0#1); 3658#L105-1 assume !(0 != main_~p5~0#1); 3660#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 3650#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3651#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3642#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3643#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3634#L129-1 assume !(0 != main_~p11~0#1); 3635#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3626#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 3627#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 3618#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 3619#L149-1 assume !(0 != main_~p1~0#1); 3735#L155-1 assume !(0 != main_~p2~0#1); 3732#L160-1 assume !(0 != main_~p3~0#1); 3727#L165-1 assume !(0 != main_~p4~0#1); 3724#L170-1 assume !(0 != main_~p5~0#1); 3721#L175-1 assume !(0 != main_~p6~0#1); 3717#L180-1 assume !(0 != main_~p7~0#1); 3712#L185-1 assume !(0 != main_~p8~0#1); 3709#L190-1 assume !(0 != main_~p9~0#1); 3705#L195-1 assume !(0 != main_~p10~0#1); 3701#L200-1 assume !(0 != main_~p11~0#1); 3697#L205-1 assume !(0 != main_~p12~0#1); 3693#L210-1 assume !(0 != main_~p13~0#1); 3689#L215-1 assume !(0 != main_~p14~0#1); 3685#L220-1 assume !(0 != main_~p15~0#1); 3450#L225-1 [2022-02-21 03:39:58,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:58,550 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-02-21 03:39:58,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:58,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364624294] [2022-02-21 03:39:58,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:58,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:58,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:58,579 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1163689094, now seen corresponding path program 1 times [2022-02-21 03:39:58,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:58,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688268333] [2022-02-21 03:39:58,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:58,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:58,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {5578#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {5578#true} is VALID [2022-02-21 03:39:58,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {5578#true} 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; {5578#true} is VALID [2022-02-21 03:39:58,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {5578#true} assume !(0 != main_~p1~0#1); {5578#true} is VALID [2022-02-21 03:39:58,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {5578#true} assume !(0 != main_~p2~0#1); {5578#true} is VALID [2022-02-21 03:39:58,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {5578#true} assume !(0 != main_~p3~0#1); {5578#true} is VALID [2022-02-21 03:39:58,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {5578#true} assume !(0 != main_~p4~0#1); {5578#true} is VALID [2022-02-21 03:39:58,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {5578#true} assume !(0 != main_~p5~0#1); {5578#true} is VALID [2022-02-21 03:39:58,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {5578#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:58,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {5580#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {5579#false} is VALID [2022-02-21 03:39:58,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {5579#false} assume !(0 != main_~p7~0#1); {5579#false} is VALID [2022-02-21 03:39:58,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {5579#false} assume !(0 != main_~p8~0#1); {5579#false} is VALID [2022-02-21 03:39:58,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {5579#false} assume !(0 != main_~p9~0#1); {5579#false} is VALID [2022-02-21 03:39:58,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {5579#false} assume !(0 != main_~p10~0#1); {5579#false} is VALID [2022-02-21 03:39:58,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {5579#false} assume !(0 != main_~p11~0#1); {5579#false} is VALID [2022-02-21 03:39:58,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {5579#false} assume !(0 != main_~p12~0#1); {5579#false} is VALID [2022-02-21 03:39:58,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {5579#false} assume !(0 != main_~p13~0#1); {5579#false} is VALID [2022-02-21 03:39:58,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {5579#false} assume !(0 != main_~p14~0#1); {5579#false} is VALID [2022-02-21 03:39:58,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {5579#false} assume !(0 != main_~p15~0#1); {5579#false} is VALID [2022-02-21 03:39:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:58,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:58,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688268333] [2022-02-21 03:39:58,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688268333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:58,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:58,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:58,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783805447] [2022-02-21 03:39:58,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:58,660 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:58,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:58,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:58,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:58,661 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) [2022-02-21 03:39:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:58,853 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2022-02-21 03:39:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:58,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:39:58,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:58,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2226 transitions. [2022-02-21 03:39:58,971 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2022-02-21 03:39:59,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2226 transitions. [2022-02-21 03:39:59,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2022-02-21 03:39:59,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2022-02-21 03:39:59,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2226 transitions. [2022-02-21 03:39:59,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:59,036 INFO L681 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2022-02-21 03:39:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2226 transitions. [2022-02-21 03:39:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2022-02-21 03:39:59,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:59,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1426 states and 2226 transitions. Second 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) [2022-02-21 03:39:59,062 INFO L74 IsIncluded]: Start isIncluded. First operand 1426 states and 2226 transitions. Second 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) [2022-02-21 03:39:59,065 INFO L87 Difference]: Start difference. First operand 1426 states and 2226 transitions. Second 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) [2022-02-21 03:39:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:59,136 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2022-02-21 03:39:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2226 transitions. [2022-02-21 03:39:59,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:59,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:59,142 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 1426 states and 2226 transitions. [2022-02-21 03:39:59,146 INFO L87 Difference]: Start difference. First 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) Second operand 1426 states and 2226 transitions. [2022-02-21 03:39:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:59,222 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2022-02-21 03:39:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2226 transitions. [2022-02-21 03:39:59,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:59,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:59,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:59,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:59,228 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) [2022-02-21 03:39:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2226 transitions. [2022-02-21 03:39:59,302 INFO L704 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2022-02-21 03:39:59,302 INFO L587 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2022-02-21 03:39:59,302 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:39:59,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2226 transitions. [2022-02-21 03:39:59,308 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2022-02-21 03:39:59,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:59,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:59,309 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:59,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] [2022-02-21 03:39:59,309 INFO L791 eck$LassoCheckResult]: Stem: 7060#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); 7051#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; 7052#L225-1 [2022-02-21 03:39:59,309 INFO L793 eck$LassoCheckResult]: Loop: 7052#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 7261#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; 7262#L93 assume !(0 != main_~p1~0#1); 7478#L93-2 assume !(0 != main_~p2~0#1); 7477#L97-1 assume !(0 != main_~p3~0#1); 7475#L101-1 assume !(0 != main_~p4~0#1); 7472#L105-1 assume !(0 != main_~p5~0#1); 7468#L109-1 assume !(0 != main_~p6~0#1); 7466#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 7464#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 7462#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7460#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 7458#L129-1 assume !(0 != main_~p11~0#1); 7456#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7454#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 7452#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 7450#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 7447#L149-1 assume !(0 != main_~p1~0#1); 7448#L155-1 assume !(0 != main_~p2~0#1); 7497#L160-1 assume !(0 != main_~p3~0#1); 7396#L165-1 assume !(0 != main_~p4~0#1); 7397#L170-1 assume !(0 != main_~p5~0#1); 7384#L175-1 assume !(0 != main_~p6~0#1); 7386#L180-1 assume !(0 != main_~p7~0#1); 7368#L185-1 assume !(0 != main_~p8~0#1); 7369#L190-1 assume !(0 != main_~p9~0#1); 7354#L195-1 assume !(0 != main_~p10~0#1); 7353#L200-1 assume !(0 != main_~p11~0#1); 7337#L205-1 assume !(0 != main_~p12~0#1); 7329#L210-1 assume !(0 != main_~p13~0#1); 7328#L215-1 assume !(0 != main_~p14~0#1); 7282#L220-1 assume !(0 != main_~p15~0#1); 7052#L225-1 [2022-02-21 03:39:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-02-21 03:39:59,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:59,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990108248] [2022-02-21 03:39:59,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:59,319 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:59,329 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:59,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:59,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1304237704, now seen corresponding path program 1 times [2022-02-21 03:39:59,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:59,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297463819] [2022-02-21 03:39:59,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:59,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:59,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {11290#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {11290#true} is VALID [2022-02-21 03:39:59,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {11290#true} 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; {11290#true} is VALID [2022-02-21 03:39:59,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {11290#true} assume !(0 != main_~p1~0#1); {11290#true} is VALID [2022-02-21 03:39:59,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {11290#true} assume !(0 != main_~p2~0#1); {11290#true} is VALID [2022-02-21 03:39:59,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {11290#true} assume !(0 != main_~p3~0#1); {11290#true} is VALID [2022-02-21 03:39:59,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {11290#true} assume !(0 != main_~p4~0#1); {11290#true} is VALID [2022-02-21 03:39:59,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {11290#true} assume !(0 != main_~p5~0#1); {11290#true} is VALID [2022-02-21 03:39:59,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {11290#true} assume !(0 != main_~p6~0#1); {11290#true} is VALID [2022-02-21 03:39:59,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {11290#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:59,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {11292#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {11291#false} is VALID [2022-02-21 03:39:59,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {11291#false} assume !(0 != main_~p8~0#1); {11291#false} is VALID [2022-02-21 03:39:59,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {11291#false} assume !(0 != main_~p9~0#1); {11291#false} is VALID [2022-02-21 03:39:59,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {11291#false} assume !(0 != main_~p10~0#1); {11291#false} is VALID [2022-02-21 03:39:59,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {11291#false} assume !(0 != main_~p11~0#1); {11291#false} is VALID [2022-02-21 03:39:59,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {11291#false} assume !(0 != main_~p12~0#1); {11291#false} is VALID [2022-02-21 03:39:59,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {11291#false} assume !(0 != main_~p13~0#1); {11291#false} is VALID [2022-02-21 03:39:59,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {11291#false} assume !(0 != main_~p14~0#1); {11291#false} is VALID [2022-02-21 03:39:59,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {11291#false} assume !(0 != main_~p15~0#1); {11291#false} is VALID [2022-02-21 03:39:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:59,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:59,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297463819] [2022-02-21 03:39:59,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297463819] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:59,411 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:59,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:59,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831574085] [2022-02-21 03:39:59,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:59,412 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:59,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:59,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:59,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:59,413 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) [2022-02-21 03:39:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:59,672 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2022-02-21 03:39:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:59,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:39:59,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:59,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4354 transitions. [2022-02-21 03:39:59,920 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2022-02-21 03:40:00,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4354 transitions. [2022-02-21 03:40:00,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2022-02-21 03:40:00,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2022-02-21 03:40:00,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4354 transitions. [2022-02-21 03:40:00,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:40:00,108 INFO L681 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2022-02-21 03:40:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4354 transitions. [2022-02-21 03:40:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2022-02-21 03:40:00,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:40:00,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2818 states and 4354 transitions. Second 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) [2022-02-21 03:40:00,170 INFO L74 IsIncluded]: Start isIncluded. First operand 2818 states and 4354 transitions. Second 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) [2022-02-21 03:40:00,177 INFO L87 Difference]: Start difference. First operand 2818 states and 4354 transitions. Second 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) [2022-02-21 03:40:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:00,386 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2022-02-21 03:40:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4354 transitions. [2022-02-21 03:40:00,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:00,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:00,402 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 2818 states and 4354 transitions. [2022-02-21 03:40:00,407 INFO L87 Difference]: Start difference. First 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) Second operand 2818 states and 4354 transitions. [2022-02-21 03:40:00,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:00,595 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2022-02-21 03:40:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4354 transitions. [2022-02-21 03:40:00,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:00,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:00,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:40:00,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:40:00,606 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) [2022-02-21 03:40:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4354 transitions. [2022-02-21 03:40:00,787 INFO L704 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2022-02-21 03:40:00,787 INFO L587 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2022-02-21 03:40:00,787 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:40:00,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4354 transitions. [2022-02-21 03:40:00,799 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2022-02-21 03:40:00,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:40:00,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:40:00,800 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:40:00,800 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] [2022-02-21 03:40:00,800 INFO L791 eck$LassoCheckResult]: Stem: 14165#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); 14153#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; 14154#L225-1 [2022-02-21 03:40:00,800 INFO L793 eck$LassoCheckResult]: Loop: 14154#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 14312#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; 14310#L93 assume !(0 != main_~p1~0#1); 14309#L93-2 assume !(0 != main_~p2~0#1); 14303#L97-1 assume !(0 != main_~p3~0#1); 14304#L101-1 assume !(0 != main_~p4~0#1); 14410#L105-1 assume !(0 != main_~p5~0#1); 14407#L109-1 assume !(0 != main_~p6~0#1); 14403#L113-1 assume !(0 != main_~p7~0#1); 14401#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 14400#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 14397#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 14394#L129-1 assume !(0 != main_~p11~0#1); 14391#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 14387#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 14383#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 14378#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 14372#L149-1 assume !(0 != main_~p1~0#1); 14366#L155-1 assume !(0 != main_~p2~0#1); 14361#L160-1 assume !(0 != main_~p3~0#1); 14354#L165-1 assume !(0 != main_~p4~0#1); 14348#L170-1 assume !(0 != main_~p5~0#1); 14343#L175-1 assume !(0 != main_~p6~0#1); 14341#L180-1 assume !(0 != main_~p7~0#1); 14335#L185-1 assume !(0 != main_~p8~0#1); 14332#L190-1 assume !(0 != main_~p9~0#1); 14328#L195-1 assume !(0 != main_~p10~0#1); 14322#L200-1 assume !(0 != main_~p11~0#1); 14320#L205-1 assume !(0 != main_~p12~0#1); 14318#L210-1 assume !(0 != main_~p13~0#1); 14316#L215-1 assume !(0 != main_~p14~0#1); 14314#L220-1 assume !(0 != main_~p15~0#1); 14154#L225-1 [2022-02-21 03:40:00,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:00,801 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-02-21 03:40:00,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:00,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460029263] [2022-02-21 03:40:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:00,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:00,809 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:40:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:00,825 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:40:00,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:00,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1170224198, now seen corresponding path program 1 times [2022-02-21 03:40:00,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:00,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570945506] [2022-02-21 03:40:00,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:00,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:40:00,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {22570#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {22570#true} is VALID [2022-02-21 03:40:00,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {22570#true} 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; {22570#true} is VALID [2022-02-21 03:40:00,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {22570#true} assume !(0 != main_~p1~0#1); {22570#true} is VALID [2022-02-21 03:40:00,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {22570#true} assume !(0 != main_~p2~0#1); {22570#true} is VALID [2022-02-21 03:40:00,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {22570#true} assume !(0 != main_~p3~0#1); {22570#true} is VALID [2022-02-21 03:40:00,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {22570#true} assume !(0 != main_~p4~0#1); {22570#true} is VALID [2022-02-21 03:40:00,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {22570#true} assume !(0 != main_~p5~0#1); {22570#true} is VALID [2022-02-21 03:40:00,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {22570#true} assume !(0 != main_~p6~0#1); {22570#true} is VALID [2022-02-21 03:40:00,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {22570#true} assume !(0 != main_~p7~0#1); {22570#true} is VALID [2022-02-21 03:40:00,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {22570#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:40:00,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {22572#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {22571#false} is VALID [2022-02-21 03:40:00,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {22571#false} assume !(0 != main_~p9~0#1); {22571#false} is VALID [2022-02-21 03:40:00,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {22571#false} assume !(0 != main_~p10~0#1); {22571#false} is VALID [2022-02-21 03:40:00,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {22571#false} assume !(0 != main_~p11~0#1); {22571#false} is VALID [2022-02-21 03:40:00,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {22571#false} assume !(0 != main_~p12~0#1); {22571#false} is VALID [2022-02-21 03:40:00,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {22571#false} assume !(0 != main_~p13~0#1); {22571#false} is VALID [2022-02-21 03:40:00,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {22571#false} assume !(0 != main_~p14~0#1); {22571#false} is VALID [2022-02-21 03:40:00,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {22571#false} assume !(0 != main_~p15~0#1); {22571#false} is VALID [2022-02-21 03:40:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:40:00,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:40:00,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570945506] [2022-02-21 03:40:00,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570945506] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:40:00,878 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:40:00,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:40:00,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686686633] [2022-02-21 03:40:00,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:40:00,878 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:40:00,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:40:00,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:40:00,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:40:00,879 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) [2022-02-21 03:40:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:01,611 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2022-02-21 03:40:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:40:01,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:40:01,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:40:01,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8514 transitions. [2022-02-21 03:40:02,312 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2022-02-21 03:40:03,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8514 transitions. [2022-02-21 03:40:03,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2022-02-21 03:40:03,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2022-02-21 03:40:03,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8514 transitions. [2022-02-21 03:40:03,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:40:03,027 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2022-02-21 03:40:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8514 transitions. [2022-02-21 03:40:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2022-02-21 03:40:03,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:40:03,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5570 states and 8514 transitions. Second 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) [2022-02-21 03:40:03,134 INFO L74 IsIncluded]: Start isIncluded. First operand 5570 states and 8514 transitions. Second 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) [2022-02-21 03:40:03,142 INFO L87 Difference]: Start difference. First operand 5570 states and 8514 transitions. Second 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) [2022-02-21 03:40:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:03,796 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2022-02-21 03:40:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 8514 transitions. [2022-02-21 03:40:03,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:03,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:03,814 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 5570 states and 8514 transitions. [2022-02-21 03:40:03,821 INFO L87 Difference]: Start difference. First 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) Second operand 5570 states and 8514 transitions. [2022-02-21 03:40:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:04,499 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2022-02-21 03:40:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 8514 transitions. [2022-02-21 03:40:04,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:04,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:04,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:40:04,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:40:04,512 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) [2022-02-21 03:40:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8514 transitions. [2022-02-21 03:40:05,238 INFO L704 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2022-02-21 03:40:05,238 INFO L587 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2022-02-21 03:40:05,238 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:40:05,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8514 transitions. [2022-02-21 03:40:05,255 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2022-02-21 03:40:05,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:40:05,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:40:05,256 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:40:05,256 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] [2022-02-21 03:40:05,256 INFO L791 eck$LassoCheckResult]: Stem: 28200#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); 28188#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; 28189#L225-1 [2022-02-21 03:40:05,256 INFO L793 eck$LassoCheckResult]: Loop: 28189#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 28438#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; 28432#L93 assume !(0 != main_~p1~0#1); 28428#L93-2 assume !(0 != main_~p2~0#1); 28425#L97-1 assume !(0 != main_~p3~0#1); 28419#L101-1 assume !(0 != main_~p4~0#1); 28413#L105-1 assume !(0 != main_~p5~0#1); 28409#L109-1 assume !(0 != main_~p6~0#1); 28404#L113-1 assume !(0 != main_~p7~0#1); 28397#L117-1 assume !(0 != main_~p8~0#1); 28398#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 28386#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 28387#L129-1 assume !(0 != main_~p11~0#1); 28378#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 28379#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 28370#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 28371#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 28361#L149-1 assume !(0 != main_~p1~0#1); 28362#L155-1 assume !(0 != main_~p2~0#1); 28351#L160-1 assume !(0 != main_~p3~0#1); 28350#L165-1 assume !(0 != main_~p4~0#1); 28337#L170-1 assume !(0 != main_~p5~0#1); 28338#L175-1 assume !(0 != main_~p6~0#1); 28328#L180-1 assume !(0 != main_~p7~0#1); 28329#L185-1 assume !(0 != main_~p8~0#1); 28480#L190-1 assume !(0 != main_~p9~0#1); 28476#L195-1 assume !(0 != main_~p10~0#1); 28472#L200-1 assume !(0 != main_~p11~0#1); 28466#L205-1 assume !(0 != main_~p12~0#1); 28460#L210-1 assume !(0 != main_~p13~0#1); 28454#L215-1 assume !(0 != main_~p14~0#1); 28448#L220-1 assume !(0 != main_~p15~0#1); 28189#L225-1 [2022-02-21 03:40:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:05,257 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-02-21 03:40:05,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:05,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187286960] [2022-02-21 03:40:05,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:05,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:05,262 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:40:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:05,266 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:40:05,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash -635214136, now seen corresponding path program 1 times [2022-02-21 03:40:05,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:05,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788218013] [2022-02-21 03:40:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:40:05,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {44858#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {44858#true} is VALID [2022-02-21 03:40:05,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {44858#true} 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; {44858#true} is VALID [2022-02-21 03:40:05,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {44858#true} assume !(0 != main_~p1~0#1); {44858#true} is VALID [2022-02-21 03:40:05,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {44858#true} assume !(0 != main_~p2~0#1); {44858#true} is VALID [2022-02-21 03:40:05,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {44858#true} assume !(0 != main_~p3~0#1); {44858#true} is VALID [2022-02-21 03:40:05,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {44858#true} assume !(0 != main_~p4~0#1); {44858#true} is VALID [2022-02-21 03:40:05,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {44858#true} assume !(0 != main_~p5~0#1); {44858#true} is VALID [2022-02-21 03:40:05,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {44858#true} assume !(0 != main_~p6~0#1); {44858#true} is VALID [2022-02-21 03:40:05,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {44858#true} assume !(0 != main_~p7~0#1); {44858#true} is VALID [2022-02-21 03:40:05,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {44858#true} assume !(0 != main_~p8~0#1); {44858#true} is VALID [2022-02-21 03:40:05,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {44858#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p11~0#1); {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p1~0#1); {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p2~0#1); {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p3~0#1); {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p4~0#1); {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p5~0#1); {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p6~0#1); {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p7~0#1); {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p8~0#1); {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:40:05,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {44860#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p9~0#1); {44859#false} is VALID [2022-02-21 03:40:05,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {44859#false} assume !(0 != main_~p10~0#1); {44859#false} is VALID [2022-02-21 03:40:05,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {44859#false} assume !(0 != main_~p11~0#1); {44859#false} is VALID [2022-02-21 03:40:05,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {44859#false} assume !(0 != main_~p12~0#1); {44859#false} is VALID [2022-02-21 03:40:05,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {44859#false} assume !(0 != main_~p13~0#1); {44859#false} is VALID [2022-02-21 03:40:05,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {44859#false} assume !(0 != main_~p14~0#1); {44859#false} is VALID [2022-02-21 03:40:05,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {44859#false} assume !(0 != main_~p15~0#1); {44859#false} is VALID [2022-02-21 03:40:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:40:05,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:40:05,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788218013] [2022-02-21 03:40:05,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788218013] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:40:05,302 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:40:05,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:40:05,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723516676] [2022-02-21 03:40:05,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:40:05,303 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:40:05,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:40:05,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:40:05,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:40:05,303 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) [2022-02-21 03:40:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:07,792 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2022-02-21 03:40:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:40:07,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:40:07,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:40:07,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16642 transitions. [2022-02-21 03:40:10,245 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2022-02-21 03:40:12,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16642 transitions. [2022-02-21 03:40:12,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2022-02-21 03:40:12,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2022-02-21 03:40:12,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16642 transitions. [2022-02-21 03:40:12,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:40:12,588 INFO L681 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2022-02-21 03:40:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16642 transitions. [2022-02-21 03:40:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2022-02-21 03:40:12,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:40:12,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11010 states and 16642 transitions. Second 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) [2022-02-21 03:40:12,794 INFO L74 IsIncluded]: Start isIncluded. First operand 11010 states and 16642 transitions. Second 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) [2022-02-21 03:40:12,814 INFO L87 Difference]: Start difference. First operand 11010 states and 16642 transitions. Second 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) [2022-02-21 03:40:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:15,358 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2022-02-21 03:40:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 11010 states and 16642 transitions. [2022-02-21 03:40:15,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:15,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:15,383 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 11010 states and 16642 transitions. [2022-02-21 03:40:15,397 INFO L87 Difference]: Start difference. First 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) Second operand 11010 states and 16642 transitions. [2022-02-21 03:40:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:18,001 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2022-02-21 03:40:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 11010 states and 16642 transitions. [2022-02-21 03:40:18,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:18,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:18,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:40:18,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:40:18,027 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) [2022-02-21 03:40:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16642 transitions. [2022-02-21 03:40:20,693 INFO L704 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2022-02-21 03:40:20,693 INFO L587 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2022-02-21 03:40:20,693 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:40:20,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16642 transitions. [2022-02-21 03:40:20,717 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2022-02-21 03:40:20,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:40:20,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:40:20,718 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:40:20,718 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] [2022-02-21 03:40:20,718 INFO L791 eck$LassoCheckResult]: Stem: 55928#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); 55916#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; 55917#L225-1 [2022-02-21 03:40:20,718 INFO L793 eck$LassoCheckResult]: Loop: 55917#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 56273#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; 56266#L93 assume !(0 != main_~p1~0#1); 56260#L93-2 assume !(0 != main_~p2~0#1); 56254#L97-1 assume !(0 != main_~p3~0#1); 56255#L101-1 assume !(0 != main_~p4~0#1); 56432#L105-1 assume !(0 != main_~p5~0#1); 56426#L109-1 assume !(0 != main_~p6~0#1); 56420#L113-1 assume !(0 != main_~p7~0#1); 56414#L117-1 assume !(0 != main_~p8~0#1); 56408#L121-1 assume !(0 != main_~p9~0#1); 56404#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 56400#L129-1 assume !(0 != main_~p11~0#1); 56394#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 56391#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 56387#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 56385#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 56381#L149-1 assume !(0 != main_~p1~0#1); 56379#L155-1 assume !(0 != main_~p2~0#1); 56377#L160-1 assume !(0 != main_~p3~0#1); 56375#L165-1 assume !(0 != main_~p4~0#1); 56370#L170-1 assume !(0 != main_~p5~0#1); 56366#L175-1 assume !(0 != main_~p6~0#1); 56362#L180-1 assume !(0 != main_~p7~0#1); 56359#L185-1 assume !(0 != main_~p8~0#1); 56353#L190-1 assume !(0 != main_~p9~0#1); 56348#L195-1 assume !(0 != main_~p10~0#1); 56316#L200-1 assume !(0 != main_~p11~0#1); 56312#L205-1 assume !(0 != main_~p12~0#1); 56308#L210-1 assume !(0 != main_~p13~0#1); 56306#L215-1 assume !(0 != main_~p14~0#1); 56282#L220-1 assume !(0 != main_~p15~0#1); 55917#L225-1 [2022-02-21 03:40:20,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-02-21 03:40:20,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:20,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168554999] [2022-02-21 03:40:20,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:20,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:40:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:20,727 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:40:20,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash -416359418, now seen corresponding path program 1 times [2022-02-21 03:40:20,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:20,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906156185] [2022-02-21 03:40:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:40:20,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {88906#true} assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {88906#true} is VALID [2022-02-21 03:40:20,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {88906#true} 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; {88906#true} is VALID [2022-02-21 03:40:20,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {88906#true} assume !(0 != main_~p1~0#1); {88906#true} is VALID [2022-02-21 03:40:20,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {88906#true} assume !(0 != main_~p2~0#1); {88906#true} is VALID [2022-02-21 03:40:20,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {88906#true} assume !(0 != main_~p3~0#1); {88906#true} is VALID [2022-02-21 03:40:20,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {88906#true} assume !(0 != main_~p4~0#1); {88906#true} is VALID [2022-02-21 03:40:20,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {88906#true} assume !(0 != main_~p5~0#1); {88906#true} is VALID [2022-02-21 03:40:20,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {88906#true} assume !(0 != main_~p6~0#1); {88906#true} is VALID [2022-02-21 03:40:20,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {88906#true} assume !(0 != main_~p7~0#1); {88906#true} is VALID [2022-02-21 03:40:20,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {88906#true} assume !(0 != main_~p8~0#1); {88906#true} is VALID [2022-02-21 03:40:20,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {88906#true} assume !(0 != main_~p9~0#1); {88906#true} is VALID [2022-02-21 03:40:20,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {88906#true} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p11~0#1); {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p1~0#1); {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p2~0#1); {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p3~0#1); {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p4~0#1); {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p5~0#1); {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p6~0#1); {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p7~0#1); {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p8~0#1); {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p9~0#1); {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:20,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {88908#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p10~0#1); {88907#false} is VALID [2022-02-21 03:40:20,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {88907#false} assume !(0 != main_~p11~0#1); {88907#false} is VALID [2022-02-21 03:40:20,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {88907#false} assume !(0 != main_~p12~0#1); {88907#false} is VALID [2022-02-21 03:40:20,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {88907#false} assume !(0 != main_~p13~0#1); {88907#false} is VALID [2022-02-21 03:40:20,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {88907#false} assume !(0 != main_~p14~0#1); {88907#false} is VALID [2022-02-21 03:40:20,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {88907#false} assume !(0 != main_~p15~0#1); {88907#false} is VALID [2022-02-21 03:40:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:40:20,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:40:20,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906156185] [2022-02-21 03:40:20,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906156185] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:40:20,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:40:20,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:40:20,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410249479] [2022-02-21 03:40:20,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:40:20,761 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:40:20,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:40:20,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:40:20,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:40:20,763 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) [2022-02-21 03:40:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:30,371 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2022-02-21 03:40:30,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:40:30,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:40:30,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:40:30,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 32514 transitions. [2022-02-21 03:40:39,461 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2022-02-21 03:40:48,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 32514 transitions. [2022-02-21 03:40:48,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2022-02-21 03:40:48,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2022-02-21 03:40:48,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 32514 transitions. [2022-02-21 03:40:48,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:40:48,579 INFO L681 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2022-02-21 03:40:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 32514 transitions. [2022-02-21 03:40:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2022-02-21 03:40:48,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:40:48,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21762 states and 32514 transitions. Second 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) [2022-02-21 03:40:48,877 INFO L74 IsIncluded]: Start isIncluded. First operand 21762 states and 32514 transitions. Second 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) [2022-02-21 03:40:48,907 INFO L87 Difference]: Start difference. First operand 21762 states and 32514 transitions. Second 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) [2022-02-21 03:40:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:58,283 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2022-02-21 03:40:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 21762 states and 32514 transitions. [2022-02-21 03:40:58,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:58,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:58,362 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 21762 states and 32514 transitions. [2022-02-21 03:40:58,382 INFO L87 Difference]: Start difference. First 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) Second operand 21762 states and 32514 transitions. [2022-02-21 03:41:07,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:41:07,977 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2022-02-21 03:41:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21762 states and 32514 transitions. [2022-02-21 03:41:07,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:41:07,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:41:07,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:41:07,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:41:08,033 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)