./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.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_14-1.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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:39:46,999 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:39:47,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:39:47,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:39:47,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:39:47,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:39:47,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:39:47,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:39:47,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:39:47,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:39:47,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:39:47,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:39:47,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:39:47,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:39:47,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:39:47,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:39:47,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:39:47,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:39:47,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:39:47,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:39:47,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:39:47,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:39:47,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:39:47,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:39:47,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:39:47,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:39:47,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:39:47,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:39:47,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:39:47,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:39:47,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:39:47,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:39:47,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:39:47,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:39:47,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:39:47,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:39:47,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:39:47,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:39:47,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:39:47,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:39:47,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:39:47,068 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:47,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:39:47,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:39:47,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:39:47,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:39:47,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:39:47,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:39:47,095 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:39:47,096 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:39:47,096 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:39:47,096 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:39:47,097 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:39:47,097 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:39:47,097 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:39:47,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:39:47,097 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:39:47,097 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:39:47,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:39:47,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:39:47,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:39:47,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:39:47,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:39:47,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:39:47,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:39:47,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:39:47,099 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:39:47,099 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:39:47,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:39:47,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:39:47,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:39:47,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:39:47,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:39:47,101 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:39:47,101 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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2022-02-21 03:39:47,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:39:47,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:39:47,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:39:47,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:39:47,302 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:39:47,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2022-02-21 03:39:47,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7fd82cb8/a2388eb21b684114b64ef9458a234f58/FLAG3374def8b [2022-02-21 03:39:47,740 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:39:47,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2022-02-21 03:39:47,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7fd82cb8/a2388eb21b684114b64ef9458a234f58/FLAG3374def8b [2022-02-21 03:39:48,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7fd82cb8/a2388eb21b684114b64ef9458a234f58 [2022-02-21 03:39:48,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:39:48,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:39:48,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:48,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:39:48,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:39:48,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:48" (1/1) ... [2022-02-21 03:39:48,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211d8379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:48, skipping insertion in model container [2022-02-21 03:39:48,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:48" (1/1) ... [2022-02-21 03:39:48,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:39:48,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:39:48,370 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_14-1.c[5283,5296] [2022-02-21 03:39:48,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:48,387 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:39:48,422 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_14-1.c[5283,5296] [2022-02-21 03:39:48,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:48,436 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:39:48,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:48 WrapperNode [2022-02-21 03:39:48,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:48,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:48,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:39:48,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:39:48,443 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:48" (1/1) ... [2022-02-21 03:39:48,454 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:48" (1/1) ... [2022-02-21 03:39:48,480 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 167 [2022-02-21 03:39:48,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:48,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:39:48,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:39:48,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:39:48,487 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:48" (1/1) ... [2022-02-21 03:39:48,487 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:48" (1/1) ... [2022-02-21 03:39:48,494 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:48" (1/1) ... [2022-02-21 03:39:48,494 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:48" (1/1) ... [2022-02-21 03:39:48,502 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:48" (1/1) ... [2022-02-21 03:39:48,507 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:48" (1/1) ... [2022-02-21 03:39:48,512 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:48" (1/1) ... [2022-02-21 03:39:48,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:39:48,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:39:48,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:39:48,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:39:48,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:48" (1/1) ... [2022-02-21 03:39:48,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:39:48,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:39:48,557 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:48,581 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:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:39:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:39:48,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:39:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:39:48,646 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:39:48,647 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:39:48,803 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:39:48,807 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:39:48,808 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:39:48,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:48 BoogieIcfgContainer [2022-02-21 03:39:48,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:39:48,810 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:39:48,810 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:39:48,812 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:39:48,812 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:48,812 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:39:48" (1/3) ... [2022-02-21 03:39:48,813 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a3073c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:48, skipping insertion in model container [2022-02-21 03:39:48,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:48,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:48" (2/3) ... [2022-02-21 03:39:48,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a3073c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:48, skipping insertion in model container [2022-02-21 03:39:48,814 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:48,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:48" (3/3) ... [2022-02-21 03:39:48,815 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2022-02-21 03:39:48,857 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:39:48,871 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:39:48,871 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:39:48,871 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:39:48,871 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:39:48,872 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:39:48,872 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:39:48,872 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:39:48,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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:48,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-02-21 03:39:48,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:48,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:48,919 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:48,920 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] [2022-02-21 03:39:48,920 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:39:48,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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:48,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-02-21 03:39:48,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:48,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:48,939 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:48,940 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] [2022-02-21 03:39:48,945 INFO L791 eck$LassoCheckResult]: Stem: 42#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); 35#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_~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_~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;havoc main_~cond~0#1; 37#L211-1true [2022-02-21 03:39:48,946 INFO L793 eck$LassoCheckResult]: Loop: 37#L211-1true assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 46#L55true 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; 22#L88true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 12#L88-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 33#L92-1true assume !(0 != main_~p3~0#1); 4#L96-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 7#L100-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 49#L104-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 13#L108-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 52#L112-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 26#L116-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 40#L120-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 34#L124-1true assume !(0 != main_~p11~0#1); 16#L128-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 47#L132-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 43#L136-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 39#L140-1true assume !(0 != main_~p1~0#1); 17#L146-1true assume !(0 != main_~p2~0#1); 31#L151-1true assume !(0 != main_~p3~0#1); 29#L156-1true assume !(0 != main_~p4~0#1); 5#L161-1true assume !(0 != main_~p5~0#1); 11#L166-1true assume !(0 != main_~p6~0#1); 24#L171-1true assume !(0 != main_~p7~0#1); 20#L176-1true assume !(0 != main_~p8~0#1); 50#L181-1true assume !(0 != main_~p9~0#1); 21#L186-1true assume !(0 != main_~p10~0#1); 38#L191-1true assume !(0 != main_~p11~0#1); 51#L196-1true assume !(0 != main_~p12~0#1); 25#L201-1true assume !(0 != main_~p13~0#1); 14#L206-1true assume !(0 != main_~p14~0#1); 37#L211-1true [2022-02-21 03:39:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:39:48,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:48,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828418725] [2022-02-21 03:39:48,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:49,039 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:49,080 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:49,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1221430905, now seen corresponding path program 1 times [2022-02-21 03:39:49,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:49,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105088839] [2022-02-21 03:39:49,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:49,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:49,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {57#true} is VALID [2022-02-21 03:39:49,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#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; {57#true} is VALID [2022-02-21 03:39:49,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:49,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {58#false} is VALID [2022-02-21 03:39:49,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {58#false} assume !(0 != main_~p2~0#1); {58#false} is VALID [2022-02-21 03:39:49,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {58#false} assume !(0 != main_~p3~0#1); {58#false} is VALID [2022-02-21 03:39:49,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {58#false} assume !(0 != main_~p4~0#1); {58#false} is VALID [2022-02-21 03:39:49,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {58#false} assume !(0 != main_~p5~0#1); {58#false} is VALID [2022-02-21 03:39:49,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {58#false} assume !(0 != main_~p6~0#1); {58#false} is VALID [2022-02-21 03:39:49,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {58#false} assume !(0 != main_~p7~0#1); {58#false} is VALID [2022-02-21 03:39:49,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {58#false} assume !(0 != main_~p8~0#1); {58#false} is VALID [2022-02-21 03:39:49,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {58#false} assume !(0 != main_~p9~0#1); {58#false} is VALID [2022-02-21 03:39:49,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {58#false} assume !(0 != main_~p10~0#1); {58#false} is VALID [2022-02-21 03:39:49,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {58#false} assume !(0 != main_~p11~0#1); {58#false} is VALID [2022-02-21 03:39:49,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {58#false} assume !(0 != main_~p12~0#1); {58#false} is VALID [2022-02-21 03:39:49,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {58#false} assume !(0 != main_~p13~0#1); {58#false} is VALID [2022-02-21 03:39:49,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {58#false} assume !(0 != main_~p14~0#1); {58#false} is VALID [2022-02-21 03:39:49,206 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:49,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:49,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105088839] [2022-02-21 03:39:49,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105088839] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:49,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:49,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:49,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591459709] [2022-02-21 03:39:49,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:49,212 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:49,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:49,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:49,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:49,238 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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.0) internal successors, (30), 3 states have internal predecessors, (30), 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:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:49,436 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2022-02-21 03:39:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:49,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:49,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:49,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2022-02-21 03:39:49,479 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-02-21 03:39:49,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 143 transitions. [2022-02-21 03:39:49,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-02-21 03:39:49,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-02-21 03:39:49,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 143 transitions. [2022-02-21 03:39:49,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:49,486 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-02-21 03:39:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 143 transitions. [2022-02-21 03:39:49,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-21 03:39:49,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:49,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states and 143 transitions. Second operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 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:49,509 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states and 143 transitions. Second operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 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:49,511 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. Second operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 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:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:49,514 INFO L93 Difference]: Finished difference Result 89 states and 143 transitions. [2022-02-21 03:39:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 143 transitions. [2022-02-21 03:39:49,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:49,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:49,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 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 89 states and 143 transitions. [2022-02-21 03:39:49,516 INFO L87 Difference]: Start difference. First operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 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 89 states and 143 transitions. [2022-02-21 03:39:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:49,520 INFO L93 Difference]: Finished difference Result 89 states and 143 transitions. [2022-02-21 03:39:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 143 transitions. [2022-02-21 03:39:49,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:49,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:49,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:49,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 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:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2022-02-21 03:39:49,525 INFO L704 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-02-21 03:39:49,525 INFO L587 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-02-21 03:39:49,525 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:39:49,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 143 transitions. [2022-02-21 03:39:49,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-02-21 03:39:49,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:49,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:49,527 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:49,527 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] [2022-02-21 03:39:49,528 INFO L791 eck$LassoCheckResult]: Stem: 190#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); 174#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_~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_~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;havoc main_~cond~0#1; 168#L211-1 [2022-02-21 03:39:49,528 INFO L793 eck$LassoCheckResult]: Loop: 168#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 179#L55 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; 202#L88 assume !(0 != main_~p1~0#1); 221#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 220#L92-1 assume !(0 != main_~p3~0#1); 219#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 218#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 208#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 185#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 186#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 205#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 183#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 172#L124-1 assume !(0 != main_~p11~0#1); 173#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 192#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 213#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 211#L140-1 assume !(0 != main_~p1~0#1); 212#L146-1 assume !(0 != main_~p2~0#1); 246#L151-1 assume !(0 != main_~p3~0#1); 244#L156-1 assume !(0 != main_~p4~0#1); 242#L161-1 assume !(0 != main_~p5~0#1); 240#L166-1 assume !(0 != main_~p6~0#1); 237#L171-1 assume !(0 != main_~p7~0#1); 236#L176-1 assume !(0 != main_~p8~0#1); 207#L181-1 assume !(0 != main_~p9~0#1); 194#L186-1 assume !(0 != main_~p10~0#1); 180#L191-1 assume !(0 != main_~p11~0#1); 176#L196-1 assume !(0 != main_~p12~0#1); 189#L201-1 assume !(0 != main_~p13~0#1); 166#L206-1 assume !(0 != main_~p14~0#1); 168#L211-1 [2022-02-21 03:39:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:39:49,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:49,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954030685] [2022-02-21 03:39:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:49,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:49,535 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:49,546 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:49,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:49,546 INFO L85 PathProgramCache]: Analyzing trace with hash 711957815, now seen corresponding path program 1 times [2022-02-21 03:39:49,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:49,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794868287] [2022-02-21 03:39:49,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:49,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:49,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {431#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {431#true} is VALID [2022-02-21 03:39:49,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#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; {431#true} is VALID [2022-02-21 03:39:49,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#true} assume !(0 != main_~p1~0#1); {431#true} is VALID [2022-02-21 03:39:49,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {431#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:49,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {433#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {432#false} is VALID [2022-02-21 03:39:49,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {432#false} assume !(0 != main_~p3~0#1); {432#false} is VALID [2022-02-21 03:39:49,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {432#false} assume !(0 != main_~p4~0#1); {432#false} is VALID [2022-02-21 03:39:49,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {432#false} assume !(0 != main_~p5~0#1); {432#false} is VALID [2022-02-21 03:39:49,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {432#false} assume !(0 != main_~p6~0#1); {432#false} is VALID [2022-02-21 03:39:49,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {432#false} assume !(0 != main_~p7~0#1); {432#false} is VALID [2022-02-21 03:39:49,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {432#false} assume !(0 != main_~p8~0#1); {432#false} is VALID [2022-02-21 03:39:49,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {432#false} assume !(0 != main_~p9~0#1); {432#false} is VALID [2022-02-21 03:39:49,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {432#false} assume !(0 != main_~p10~0#1); {432#false} is VALID [2022-02-21 03:39:49,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {432#false} assume !(0 != main_~p11~0#1); {432#false} is VALID [2022-02-21 03:39:49,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {432#false} assume !(0 != main_~p12~0#1); {432#false} is VALID [2022-02-21 03:39:49,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {432#false} assume !(0 != main_~p13~0#1); {432#false} is VALID [2022-02-21 03:39:49,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {432#false} assume !(0 != main_~p14~0#1); {432#false} is VALID [2022-02-21 03:39:49,594 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:49,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:49,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794868287] [2022-02-21 03:39:49,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794868287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:49,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:49,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:49,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425260081] [2022-02-21 03:39:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:49,597 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:49,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:49,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:49,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:49,600 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:49,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:49,716 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2022-02-21 03:39:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:49,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:49,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:49,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 278 transitions. [2022-02-21 03:39:49,754 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-02-21 03:39:49,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 278 transitions. [2022-02-21 03:39:49,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-02-21 03:39:49,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-02-21 03:39:49,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 278 transitions. [2022-02-21 03:39:49,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:49,764 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-02-21 03:39:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 278 transitions. [2022-02-21 03:39:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-02-21 03:39:49,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:49,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states and 278 transitions. Second operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 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:49,778 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states and 278 transitions. Second operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 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:49,779 INFO L87 Difference]: Start difference. First operand 174 states and 278 transitions. Second operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 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:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:49,783 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2022-02-21 03:39:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 278 transitions. [2022-02-21 03:39:49,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:49,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:49,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 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 174 states and 278 transitions. [2022-02-21 03:39:49,784 INFO L87 Difference]: Start difference. First operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 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 174 states and 278 transitions. [2022-02-21 03:39:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:49,792 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2022-02-21 03:39:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 278 transitions. [2022-02-21 03:39:49,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:49,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:49,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:49,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 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:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 278 transitions. [2022-02-21 03:39:49,799 INFO L704 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-02-21 03:39:49,799 INFO L587 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-02-21 03:39:49,799 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:39:49,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 278 transitions. [2022-02-21 03:39:49,800 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-02-21 03:39:49,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:49,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:49,801 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:49,801 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] [2022-02-21 03:39:49,801 INFO L791 eck$LassoCheckResult]: Stem: 643#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); 623#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_~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_~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;havoc main_~cond~0#1; 624#L211-1 [2022-02-21 03:39:49,802 INFO L793 eck$LassoCheckResult]: Loop: 624#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 655#L55 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; 656#L88 assume !(0 != main_~p1~0#1); 687#L88-2 assume !(0 != main_~p2~0#1); 610#L92-1 assume !(0 != main_~p3~0#1); 608#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 609#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 620#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 677#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 676#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 660#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 635#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 621#L124-1 assume !(0 != main_~p11~0#1); 622#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 645#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 671#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 672#L140-1 assume !(0 != main_~p1~0#1); 739#L146-1 assume !(0 != main_~p2~0#1); 736#L151-1 assume !(0 != main_~p3~0#1); 734#L156-1 assume !(0 != main_~p4~0#1); 732#L161-1 assume !(0 != main_~p5~0#1); 730#L166-1 assume !(0 != main_~p6~0#1); 727#L171-1 assume !(0 != main_~p7~0#1); 726#L176-1 assume !(0 != main_~p8~0#1); 724#L181-1 assume !(0 != main_~p9~0#1); 720#L186-1 assume !(0 != main_~p10~0#1); 700#L191-1 assume !(0 != main_~p11~0#1); 698#L196-1 assume !(0 != main_~p12~0#1); 696#L201-1 assume !(0 != main_~p13~0#1); 690#L206-1 assume !(0 != main_~p14~0#1); 624#L211-1 [2022-02-21 03:39:49,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:49,802 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-02-21 03:39:49,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:49,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504417943] [2022-02-21 03:39:49,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:49,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:49,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:49,813 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:49,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1659781447, now seen corresponding path program 1 times [2022-02-21 03:39:49,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:49,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100767972] [2022-02-21 03:39:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:49,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {1135#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {1135#true} is VALID [2022-02-21 03:39:49,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {1135#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; {1135#true} is VALID [2022-02-21 03:39:49,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {1135#true} assume !(0 != main_~p1~0#1); {1135#true} is VALID [2022-02-21 03:39:49,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {1135#true} assume !(0 != main_~p2~0#1); {1135#true} is VALID [2022-02-21 03:39:49,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {1135#true} assume !(0 != main_~p3~0#1); {1135#true} is VALID [2022-02-21 03:39:49,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {1135#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:49,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {1137#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {1136#false} is VALID [2022-02-21 03:39:49,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#false} assume !(0 != main_~p5~0#1); {1136#false} is VALID [2022-02-21 03:39:49,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#false} assume !(0 != main_~p6~0#1); {1136#false} is VALID [2022-02-21 03:39:49,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#false} assume !(0 != main_~p7~0#1); {1136#false} is VALID [2022-02-21 03:39:49,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {1136#false} assume !(0 != main_~p8~0#1); {1136#false} is VALID [2022-02-21 03:39:49,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {1136#false} assume !(0 != main_~p9~0#1); {1136#false} is VALID [2022-02-21 03:39:49,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#false} assume !(0 != main_~p10~0#1); {1136#false} is VALID [2022-02-21 03:39:49,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#false} assume !(0 != main_~p11~0#1); {1136#false} is VALID [2022-02-21 03:39:49,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {1136#false} assume !(0 != main_~p12~0#1); {1136#false} is VALID [2022-02-21 03:39:49,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {1136#false} assume !(0 != main_~p13~0#1); {1136#false} is VALID [2022-02-21 03:39:49,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {1136#false} assume !(0 != main_~p14~0#1); {1136#false} is VALID [2022-02-21 03:39:49,851 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:49,851 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:49,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100767972] [2022-02-21 03:39:49,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100767972] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:49,852 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:49,852 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:49,852 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313609302] [2022-02-21 03:39:49,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:49,852 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:49,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:49,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:49,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:49,853 INFO L87 Difference]: Start difference. First operand 174 states and 278 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:49,939 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2022-02-21 03:39:49,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:49,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:49,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:49,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 542 transitions. [2022-02-21 03:39:49,986 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-02-21 03:39:49,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 542 transitions. [2022-02-21 03:39:49,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2022-02-21 03:39:49,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2022-02-21 03:39:49,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 542 transitions. [2022-02-21 03:39:49,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:49,995 INFO L681 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-02-21 03:39:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 542 transitions. [2022-02-21 03:39:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-02-21 03:39:50,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:50,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states and 542 transitions. Second operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 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:50,004 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states and 542 transitions. Second operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 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:50,004 INFO L87 Difference]: Start difference. First operand 342 states and 542 transitions. Second operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 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:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:50,011 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2022-02-21 03:39:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 542 transitions. [2022-02-21 03:39:50,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:50,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:50,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 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 342 states and 542 transitions. [2022-02-21 03:39:50,013 INFO L87 Difference]: Start difference. First operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 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 342 states and 542 transitions. [2022-02-21 03:39:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:50,020 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2022-02-21 03:39:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 542 transitions. [2022-02-21 03:39:50,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:50,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:50,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:50,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 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:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 542 transitions. [2022-02-21 03:39:50,027 INFO L704 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-02-21 03:39:50,028 INFO L587 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-02-21 03:39:50,028 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:39:50,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 542 transitions. [2022-02-21 03:39:50,029 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-02-21 03:39:50,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:50,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:50,029 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:50,029 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] [2022-02-21 03:39:50,029 INFO L791 eck$LassoCheckResult]: Stem: 1513#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); 1497#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_~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_~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;havoc main_~cond~0#1; 1498#L211-1 [2022-02-21 03:39:50,030 INFO L793 eck$LassoCheckResult]: Loop: 1498#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1557#L55 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; 1552#L88 assume !(0 != main_~p1~0#1); 1553#L88-2 assume !(0 != main_~p2~0#1); 1682#L92-1 assume !(0 != main_~p3~0#1); 1679#L96-1 assume !(0 != main_~p4~0#1); 1677#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1675#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1673#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1671#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1669#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1667#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1665#L124-1 assume !(0 != main_~p11~0#1); 1663#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1661#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1659#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1655#L140-1 assume !(0 != main_~p1~0#1); 1653#L146-1 assume !(0 != main_~p2~0#1); 1651#L151-1 assume !(0 != main_~p3~0#1); 1646#L156-1 assume !(0 != main_~p4~0#1); 1644#L161-1 assume !(0 != main_~p5~0#1); 1638#L166-1 assume !(0 != main_~p6~0#1); 1633#L171-1 assume !(0 != main_~p7~0#1); 1630#L176-1 assume !(0 != main_~p8~0#1); 1628#L181-1 assume !(0 != main_~p9~0#1); 1625#L186-1 assume !(0 != main_~p10~0#1); 1622#L191-1 assume !(0 != main_~p11~0#1); 1618#L196-1 assume !(0 != main_~p12~0#1); 1598#L201-1 assume !(0 != main_~p13~0#1); 1568#L206-1 assume !(0 != main_~p14~0#1); 1498#L211-1 [2022-02-21 03:39:50,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-02-21 03:39:50,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:50,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79188529] [2022-02-21 03:39:50,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:50,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:50,037 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:50,041 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1519232837, now seen corresponding path program 1 times [2022-02-21 03:39:50,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:50,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210924759] [2022-02-21 03:39:50,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:50,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:50,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {2511#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {2511#true} is VALID [2022-02-21 03:39:50,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {2511#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; {2511#true} is VALID [2022-02-21 03:39:50,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {2511#true} assume !(0 != main_~p1~0#1); {2511#true} is VALID [2022-02-21 03:39:50,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {2511#true} assume !(0 != main_~p2~0#1); {2511#true} is VALID [2022-02-21 03:39:50,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {2511#true} assume !(0 != main_~p3~0#1); {2511#true} is VALID [2022-02-21 03:39:50,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {2511#true} assume !(0 != main_~p4~0#1); {2511#true} is VALID [2022-02-21 03:39:50,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {2511#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:50,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {2513#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {2512#false} is VALID [2022-02-21 03:39:50,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {2512#false} assume !(0 != main_~p6~0#1); {2512#false} is VALID [2022-02-21 03:39:50,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {2512#false} assume !(0 != main_~p7~0#1); {2512#false} is VALID [2022-02-21 03:39:50,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {2512#false} assume !(0 != main_~p8~0#1); {2512#false} is VALID [2022-02-21 03:39:50,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {2512#false} assume !(0 != main_~p9~0#1); {2512#false} is VALID [2022-02-21 03:39:50,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {2512#false} assume !(0 != main_~p10~0#1); {2512#false} is VALID [2022-02-21 03:39:50,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {2512#false} assume !(0 != main_~p11~0#1); {2512#false} is VALID [2022-02-21 03:39:50,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {2512#false} assume !(0 != main_~p12~0#1); {2512#false} is VALID [2022-02-21 03:39:50,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {2512#false} assume !(0 != main_~p13~0#1); {2512#false} is VALID [2022-02-21 03:39:50,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {2512#false} assume !(0 != main_~p14~0#1); {2512#false} is VALID [2022-02-21 03:39:50,076 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:50,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:50,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210924759] [2022-02-21 03:39:50,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210924759] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:50,076 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:50,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:50,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646111473] [2022-02-21 03:39:50,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:50,077 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:50,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:50,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:50,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:50,077 INFO L87 Difference]: Start difference. First operand 342 states and 542 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:50,163 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2022-02-21 03:39:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:50,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:50,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:50,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1058 transitions. [2022-02-21 03:39:50,202 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-02-21 03:39:50,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1058 transitions. [2022-02-21 03:39:50,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2022-02-21 03:39:50,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2022-02-21 03:39:50,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1058 transitions. [2022-02-21 03:39:50,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:50,218 INFO L681 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-02-21 03:39:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1058 transitions. [2022-02-21 03:39:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2022-02-21 03:39:50,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:50,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 674 states and 1058 transitions. Second operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 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:50,227 INFO L74 IsIncluded]: Start isIncluded. First operand 674 states and 1058 transitions. Second operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 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:50,228 INFO L87 Difference]: Start difference. First operand 674 states and 1058 transitions. Second operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 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:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:50,242 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2022-02-21 03:39:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1058 transitions. [2022-02-21 03:39:50,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:50,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:50,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 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 674 states and 1058 transitions. [2022-02-21 03:39:50,245 INFO L87 Difference]: Start difference. First operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 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 674 states and 1058 transitions. [2022-02-21 03:39:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:50,259 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2022-02-21 03:39:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1058 transitions. [2022-02-21 03:39:50,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:50,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:50,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:50,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 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:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1058 transitions. [2022-02-21 03:39:50,274 INFO L704 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-02-21 03:39:50,274 INFO L587 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-02-21 03:39:50,274 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:39:50,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1058 transitions. [2022-02-21 03:39:50,276 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-02-21 03:39:50,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:50,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:50,277 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:50,277 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] [2022-02-21 03:39:50,277 INFO L791 eck$LassoCheckResult]: Stem: 3223#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); 3203#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_~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_~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;havoc main_~cond~0#1; 3204#L211-1 [2022-02-21 03:39:50,277 INFO L793 eck$LassoCheckResult]: Loop: 3204#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 3299#L55 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; 3273#L88 assume !(0 != main_~p1~0#1); 3274#L88-2 assume !(0 != main_~p2~0#1); 3515#L92-1 assume !(0 != main_~p3~0#1); 3511#L96-1 assume !(0 != main_~p4~0#1); 3506#L100-1 assume !(0 != main_~p5~0#1); 3505#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 3504#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3490#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3488#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3485#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3486#L124-1 assume !(0 != main_~p11~0#1); 3489#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3487#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 3484#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 3482#L140-1 assume !(0 != main_~p1~0#1); 3480#L146-1 assume !(0 != main_~p2~0#1); 3478#L151-1 assume !(0 != main_~p3~0#1); 3475#L156-1 assume !(0 != main_~p4~0#1); 3471#L161-1 assume !(0 != main_~p5~0#1); 3464#L166-1 assume !(0 != main_~p6~0#1); 3454#L171-1 assume !(0 != main_~p7~0#1); 3427#L176-1 assume !(0 != main_~p8~0#1); 3423#L181-1 assume !(0 != main_~p9~0#1); 3420#L186-1 assume !(0 != main_~p10~0#1); 3419#L191-1 assume !(0 != main_~p11~0#1); 3417#L196-1 assume !(0 != main_~p12~0#1); 3413#L201-1 assume !(0 != main_~p13~0#1); 3304#L206-1 assume !(0 != main_~p14~0#1); 3204#L211-1 [2022-02-21 03:39:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-02-21 03:39:50,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:50,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429641429] [2022-02-21 03:39:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:50,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:50,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:50,286 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:50,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1653246343, now seen corresponding path program 1 times [2022-02-21 03:39:50,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:50,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888272277] [2022-02-21 03:39:50,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:50,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:50,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {5215#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {5215#true} is VALID [2022-02-21 03:39:50,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {5215#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; {5215#true} is VALID [2022-02-21 03:39:50,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {5215#true} assume !(0 != main_~p1~0#1); {5215#true} is VALID [2022-02-21 03:39:50,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {5215#true} assume !(0 != main_~p2~0#1); {5215#true} is VALID [2022-02-21 03:39:50,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {5215#true} assume !(0 != main_~p3~0#1); {5215#true} is VALID [2022-02-21 03:39:50,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {5215#true} assume !(0 != main_~p4~0#1); {5215#true} is VALID [2022-02-21 03:39:50,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {5215#true} assume !(0 != main_~p5~0#1); {5215#true} is VALID [2022-02-21 03:39:50,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {5215#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:50,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {5217#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {5216#false} is VALID [2022-02-21 03:39:50,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {5216#false} assume !(0 != main_~p7~0#1); {5216#false} is VALID [2022-02-21 03:39:50,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {5216#false} assume !(0 != main_~p8~0#1); {5216#false} is VALID [2022-02-21 03:39:50,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {5216#false} assume !(0 != main_~p9~0#1); {5216#false} is VALID [2022-02-21 03:39:50,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {5216#false} assume !(0 != main_~p10~0#1); {5216#false} is VALID [2022-02-21 03:39:50,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {5216#false} assume !(0 != main_~p11~0#1); {5216#false} is VALID [2022-02-21 03:39:50,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {5216#false} assume !(0 != main_~p12~0#1); {5216#false} is VALID [2022-02-21 03:39:50,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {5216#false} assume !(0 != main_~p13~0#1); {5216#false} is VALID [2022-02-21 03:39:50,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {5216#false} assume !(0 != main_~p14~0#1); {5216#false} is VALID [2022-02-21 03:39:50,312 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:50,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:50,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888272277] [2022-02-21 03:39:50,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888272277] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:50,313 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:50,313 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:50,313 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897566663] [2022-02-21 03:39:50,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:50,313 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:50,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:50,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:50,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:50,314 INFO L87 Difference]: Start difference. First operand 674 states and 1058 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:50,419 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2022-02-21 03:39:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:50,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:50,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:50,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2066 transitions. [2022-02-21 03:39:50,488 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-02-21 03:39:50,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2066 transitions. [2022-02-21 03:39:50,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2022-02-21 03:39:50,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2022-02-21 03:39:50,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2066 transitions. [2022-02-21 03:39:50,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:50,532 INFO L681 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-02-21 03:39:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2066 transitions. [2022-02-21 03:39:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2022-02-21 03:39:50,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:50,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1330 states and 2066 transitions. Second operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 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:50,547 INFO L74 IsIncluded]: Start isIncluded. First operand 1330 states and 2066 transitions. Second operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 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:50,549 INFO L87 Difference]: Start difference. First operand 1330 states and 2066 transitions. Second operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 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:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:50,589 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2022-02-21 03:39:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 2066 transitions. [2022-02-21 03:39:50,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:50,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:50,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 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 1330 states and 2066 transitions. [2022-02-21 03:39:50,594 INFO L87 Difference]: Start difference. First operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 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 1330 states and 2066 transitions. [2022-02-21 03:39:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:50,634 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2022-02-21 03:39:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 2066 transitions. [2022-02-21 03:39:50,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:50,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:50,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:50,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 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:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2066 transitions. [2022-02-21 03:39:50,680 INFO L704 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-02-21 03:39:50,680 INFO L587 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-02-21 03:39:50,680 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:39:50,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2066 transitions. [2022-02-21 03:39:50,684 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-02-21 03:39:50,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:50,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:50,685 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:50,685 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] [2022-02-21 03:39:50,685 INFO L791 eck$LassoCheckResult]: Stem: 6584#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); 6563#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_~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_~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;havoc main_~cond~0#1; 6564#L211-1 [2022-02-21 03:39:50,685 INFO L793 eck$LassoCheckResult]: Loop: 6564#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 6681#L55 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; 6682#L88 assume !(0 != main_~p1~0#1); 6859#L88-2 assume !(0 != main_~p2~0#1); 6919#L92-1 assume !(0 != main_~p3~0#1); 6924#L96-1 assume !(0 != main_~p4~0#1); 6920#L100-1 assume !(0 != main_~p5~0#1); 6768#L104-1 assume !(0 != main_~p6~0#1); 6770#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 6760#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6761#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6752#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6753#L124-1 assume !(0 != main_~p11~0#1); 6744#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 6745#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 6736#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 6737#L140-1 assume !(0 != main_~p1~0#1); 6906#L146-1 assume !(0 != main_~p2~0#1); 6903#L151-1 assume !(0 != main_~p3~0#1); 6902#L156-1 assume !(0 != main_~p4~0#1); 6890#L161-1 assume !(0 != main_~p5~0#1); 6892#L166-1 assume !(0 != main_~p6~0#1); 6946#L171-1 assume !(0 != main_~p7~0#1); 6944#L176-1 assume !(0 != main_~p8~0#1); 6941#L181-1 assume !(0 != main_~p9~0#1); 6937#L186-1 assume !(0 != main_~p10~0#1); 6935#L191-1 assume !(0 != main_~p11~0#1); 6932#L196-1 assume !(0 != main_~p12~0#1); 6930#L201-1 assume !(0 != main_~p13~0#1); 6691#L206-1 assume !(0 != main_~p14~0#1); 6564#L211-1 [2022-02-21 03:39:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-02-21 03:39:50,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:50,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680192990] [2022-02-21 03:39:50,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:50,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:50,691 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:50,694 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:50,694 INFO L85 PathProgramCache]: Analyzing trace with hash 836282619, now seen corresponding path program 1 times [2022-02-21 03:39:50,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:50,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348968585] [2022-02-21 03:39:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:50,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:50,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {10543#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {10543#true} is VALID [2022-02-21 03:39:50,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {10543#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; {10543#true} is VALID [2022-02-21 03:39:50,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {10543#true} assume !(0 != main_~p1~0#1); {10543#true} is VALID [2022-02-21 03:39:50,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {10543#true} assume !(0 != main_~p2~0#1); {10543#true} is VALID [2022-02-21 03:39:50,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {10543#true} assume !(0 != main_~p3~0#1); {10543#true} is VALID [2022-02-21 03:39:50,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {10543#true} assume !(0 != main_~p4~0#1); {10543#true} is VALID [2022-02-21 03:39:50,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {10543#true} assume !(0 != main_~p5~0#1); {10543#true} is VALID [2022-02-21 03:39:50,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {10543#true} assume !(0 != main_~p6~0#1); {10543#true} is VALID [2022-02-21 03:39:50,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {10543#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:50,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {10545#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {10544#false} is VALID [2022-02-21 03:39:50,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {10544#false} assume !(0 != main_~p8~0#1); {10544#false} is VALID [2022-02-21 03:39:50,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {10544#false} assume !(0 != main_~p9~0#1); {10544#false} is VALID [2022-02-21 03:39:50,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {10544#false} assume !(0 != main_~p10~0#1); {10544#false} is VALID [2022-02-21 03:39:50,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {10544#false} assume !(0 != main_~p11~0#1); {10544#false} is VALID [2022-02-21 03:39:50,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {10544#false} assume !(0 != main_~p12~0#1); {10544#false} is VALID [2022-02-21 03:39:50,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {10544#false} assume !(0 != main_~p13~0#1); {10544#false} is VALID [2022-02-21 03:39:50,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {10544#false} assume !(0 != main_~p14~0#1); {10544#false} is VALID [2022-02-21 03:39:50,730 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:50,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:50,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348968585] [2022-02-21 03:39:50,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348968585] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:50,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:50,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:50,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377109776] [2022-02-21 03:39:50,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:50,731 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:50,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:50,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:50,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:50,731 INFO L87 Difference]: Start difference. First operand 1330 states and 2066 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:50,937 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2022-02-21 03:39:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:50,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:50,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:50,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 4034 transitions. [2022-02-21 03:39:51,112 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-02-21 03:39:51,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 4034 transitions. [2022-02-21 03:39:51,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2022-02-21 03:39:51,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2022-02-21 03:39:51,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 4034 transitions. [2022-02-21 03:39:51,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:51,259 INFO L681 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-02-21 03:39:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 4034 transitions. [2022-02-21 03:39:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2022-02-21 03:39:51,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:51,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2626 states and 4034 transitions. Second operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:51,288 INFO L74 IsIncluded]: Start isIncluded. First operand 2626 states and 4034 transitions. Second operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:51,290 INFO L87 Difference]: Start difference. First operand 2626 states and 4034 transitions. Second operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:51,435 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2022-02-21 03:39:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 4034 transitions. [2022-02-21 03:39:51,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:51,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:51,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2626 states and 4034 transitions. [2022-02-21 03:39:51,445 INFO L87 Difference]: Start difference. First operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2626 states and 4034 transitions. [2022-02-21 03:39:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:51,589 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2022-02-21 03:39:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 4034 transitions. [2022-02-21 03:39:51,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:51,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:51,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:51,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:39:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4034 transitions. [2022-02-21 03:39:51,742 INFO L704 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-02-21 03:39:51,743 INFO L587 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-02-21 03:39:51,743 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:39:51,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 4034 transitions. [2022-02-21 03:39:51,750 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-02-21 03:39:51,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:51,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:51,750 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:51,750 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] [2022-02-21 03:39:51,751 INFO L791 eck$LassoCheckResult]: Stem: 13204#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); 13186#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_~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_~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;havoc main_~cond~0#1; 13187#L211-1 [2022-02-21 03:39:51,751 INFO L793 eck$LassoCheckResult]: Loop: 13187#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 13331#L55 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; 13327#L88 assume !(0 != main_~p1~0#1); 13320#L88-2 assume !(0 != main_~p2~0#1); 13315#L92-1 assume !(0 != main_~p3~0#1); 13308#L96-1 assume !(0 != main_~p4~0#1); 13300#L100-1 assume !(0 != main_~p5~0#1); 13292#L104-1 assume !(0 != main_~p6~0#1); 13286#L108-1 assume !(0 != main_~p7~0#1); 13280#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 13281#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 13272#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 13273#L124-1 assume !(0 != main_~p11~0#1); 13264#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 13265#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 13256#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 13257#L140-1 assume !(0 != main_~p1~0#1); 13405#L146-1 assume !(0 != main_~p2~0#1); 13400#L151-1 assume !(0 != main_~p3~0#1); 13393#L156-1 assume !(0 != main_~p4~0#1); 13387#L161-1 assume !(0 != main_~p5~0#1); 13379#L166-1 assume !(0 != main_~p6~0#1); 13375#L171-1 assume !(0 != main_~p7~0#1); 13372#L176-1 assume !(0 != main_~p8~0#1); 13370#L181-1 assume !(0 != main_~p9~0#1); 13367#L186-1 assume !(0 != main_~p10~0#1); 13366#L191-1 assume !(0 != main_~p11~0#1); 13364#L196-1 assume !(0 != main_~p12~0#1); 13362#L201-1 assume !(0 != main_~p13~0#1); 13340#L206-1 assume !(0 != main_~p14~0#1); 13187#L211-1 [2022-02-21 03:39:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:51,751 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-02-21 03:39:51,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:51,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747476957] [2022-02-21 03:39:51,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:51,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:51,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:51,758 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:51,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1055137337, now seen corresponding path program 1 times [2022-02-21 03:39:51,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:51,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607048267] [2022-02-21 03:39:51,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:51,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:51,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {21055#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {21055#true} is VALID [2022-02-21 03:39:51,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {21055#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; {21055#true} is VALID [2022-02-21 03:39:51,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {21055#true} assume !(0 != main_~p1~0#1); {21055#true} is VALID [2022-02-21 03:39:51,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {21055#true} assume !(0 != main_~p2~0#1); {21055#true} is VALID [2022-02-21 03:39:51,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {21055#true} assume !(0 != main_~p3~0#1); {21055#true} is VALID [2022-02-21 03:39:51,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {21055#true} assume !(0 != main_~p4~0#1); {21055#true} is VALID [2022-02-21 03:39:51,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {21055#true} assume !(0 != main_~p5~0#1); {21055#true} is VALID [2022-02-21 03:39:51,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {21055#true} assume !(0 != main_~p6~0#1); {21055#true} is VALID [2022-02-21 03:39:51,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {21055#true} assume !(0 != main_~p7~0#1); {21055#true} is VALID [2022-02-21 03:39:51,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {21055#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:51,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {21057#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {21056#false} is VALID [2022-02-21 03:39:51,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {21056#false} assume !(0 != main_~p9~0#1); {21056#false} is VALID [2022-02-21 03:39:51,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {21056#false} assume !(0 != main_~p10~0#1); {21056#false} is VALID [2022-02-21 03:39:51,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {21056#false} assume !(0 != main_~p11~0#1); {21056#false} is VALID [2022-02-21 03:39:51,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {21056#false} assume !(0 != main_~p12~0#1); {21056#false} is VALID [2022-02-21 03:39:51,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {21056#false} assume !(0 != main_~p13~0#1); {21056#false} is VALID [2022-02-21 03:39:51,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {21056#false} assume !(0 != main_~p14~0#1); {21056#false} is VALID [2022-02-21 03:39:51,798 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:51,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:51,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607048267] [2022-02-21 03:39:51,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607048267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:51,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:51,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:51,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622680523] [2022-02-21 03:39:51,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:51,800 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:51,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:51,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:51,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:51,802 INFO L87 Difference]: Start difference. First operand 2626 states and 4034 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:52,436 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2022-02-21 03:39:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:52,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:52,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:52,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7874 transitions. [2022-02-21 03:39:53,023 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-02-21 03:39:53,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7874 transitions. [2022-02-21 03:39:53,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2022-02-21 03:39:53,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2022-02-21 03:39:53,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7874 transitions. [2022-02-21 03:39:53,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:53,597 INFO L681 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-02-21 03:39:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7874 transitions. [2022-02-21 03:39:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2022-02-21 03:39:53,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:53,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5186 states and 7874 transitions. Second operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 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:53,657 INFO L74 IsIncluded]: Start isIncluded. First operand 5186 states and 7874 transitions. Second operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 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:53,663 INFO L87 Difference]: Start difference. First operand 5186 states and 7874 transitions. Second operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 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:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:54,217 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2022-02-21 03:39:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 7874 transitions. [2022-02-21 03:39:54,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:54,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:54,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 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 5186 states and 7874 transitions. [2022-02-21 03:39:54,295 INFO L87 Difference]: Start difference. First operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 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 5186 states and 7874 transitions. [2022-02-21 03:39:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:55,082 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2022-02-21 03:39:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 7874 transitions. [2022-02-21 03:39:55,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:55,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:55,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:55,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 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:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7874 transitions. [2022-02-21 03:39:55,861 INFO L704 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-02-21 03:39:55,861 INFO L587 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-02-21 03:39:55,861 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:39:55,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7874 transitions. [2022-02-21 03:39:55,876 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-02-21 03:39:55,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:55,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:55,877 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:55,877 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] [2022-02-21 03:39:55,877 INFO L791 eck$LassoCheckResult]: Stem: 26281#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); 26260#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_~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_~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;havoc main_~cond~0#1; 26261#L211-1 [2022-02-21 03:39:55,877 INFO L793 eck$LassoCheckResult]: Loop: 26261#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 26848#L55 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; 26845#L88 assume !(0 != main_~p1~0#1); 26842#L88-2 assume !(0 != main_~p2~0#1); 26840#L92-1 assume !(0 != main_~p3~0#1); 26837#L96-1 assume !(0 != main_~p4~0#1); 26833#L100-1 assume !(0 != main_~p5~0#1); 26830#L104-1 assume !(0 != main_~p6~0#1); 26827#L108-1 assume !(0 != main_~p7~0#1); 26633#L112-1 assume !(0 != main_~p8~0#1); 26635#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 26579#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 26576#L124-1 assume !(0 != main_~p11~0#1); 26571#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 26572#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 26562#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 26563#L140-1 assume !(0 != main_~p1~0#1); 26552#L146-1 assume !(0 != main_~p2~0#1); 26554#L151-1 assume !(0 != main_~p3~0#1); 26543#L156-1 assume !(0 != main_~p4~0#1); 26545#L161-1 assume !(0 != main_~p5~0#1); 26878#L166-1 assume !(0 != main_~p6~0#1); 26877#L171-1 assume !(0 != main_~p7~0#1); 26875#L176-1 assume !(0 != main_~p8~0#1); 26873#L181-1 assume !(0 != main_~p9~0#1); 26868#L186-1 assume !(0 != main_~p10~0#1); 26865#L191-1 assume !(0 != main_~p11~0#1); 26861#L196-1 assume !(0 != main_~p12~0#1); 26857#L201-1 assume !(0 != main_~p13~0#1); 26853#L206-1 assume !(0 != main_~p14~0#1); 26261#L211-1 [2022-02-21 03:39:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:55,878 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-02-21 03:39:55,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:55,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847003852] [2022-02-21 03:39:55,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:55,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:55,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:55,885 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:55,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1477839163, now seen corresponding path program 1 times [2022-02-21 03:39:55,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:55,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661487728] [2022-02-21 03:39:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:55,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:55,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {41807#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {41807#true} is VALID [2022-02-21 03:39:55,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {41807#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; {41807#true} is VALID [2022-02-21 03:39:55,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {41807#true} assume !(0 != main_~p1~0#1); {41807#true} is VALID [2022-02-21 03:39:55,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {41807#true} assume !(0 != main_~p2~0#1); {41807#true} is VALID [2022-02-21 03:39:55,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {41807#true} assume !(0 != main_~p3~0#1); {41807#true} is VALID [2022-02-21 03:39:55,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {41807#true} assume !(0 != main_~p4~0#1); {41807#true} is VALID [2022-02-21 03:39:55,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {41807#true} assume !(0 != main_~p5~0#1); {41807#true} is VALID [2022-02-21 03:39:55,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {41807#true} assume !(0 != main_~p6~0#1); {41807#true} is VALID [2022-02-21 03:39:55,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {41807#true} assume !(0 != main_~p7~0#1); {41807#true} is VALID [2022-02-21 03:39:55,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {41807#true} assume !(0 != main_~p8~0#1); {41807#true} is VALID [2022-02-21 03:39:55,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {41807#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p11~0#1); {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p1~0#1); {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p2~0#1); {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p3~0#1); {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p4~0#1); {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p5~0#1); {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p6~0#1); {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p7~0#1); {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p8~0#1); {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:55,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {41809#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p9~0#1); {41808#false} is VALID [2022-02-21 03:39:55,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {41808#false} assume !(0 != main_~p10~0#1); {41808#false} is VALID [2022-02-21 03:39:55,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {41808#false} assume !(0 != main_~p11~0#1); {41808#false} is VALID [2022-02-21 03:39:55,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {41808#false} assume !(0 != main_~p12~0#1); {41808#false} is VALID [2022-02-21 03:39:55,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {41808#false} assume !(0 != main_~p13~0#1); {41808#false} is VALID [2022-02-21 03:39:55,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {41808#false} assume !(0 != main_~p14~0#1); {41808#false} is VALID [2022-02-21 03:39:55,907 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:55,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:55,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661487728] [2022-02-21 03:39:55,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661487728] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:55,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:55,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:55,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746892206] [2022-02-21 03:39:55,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:55,908 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:55,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:55,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:55,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:55,909 INFO L87 Difference]: Start difference. First operand 5186 states and 7874 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:58,256 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2022-02-21 03:39:58,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:58,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:58,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 15362 transitions. [2022-02-21 03:40:00,483 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-02-21 03:40:02,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 15362 transitions. [2022-02-21 03:40:02,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2022-02-21 03:40:02,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2022-02-21 03:40:02,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 15362 transitions. [2022-02-21 03:40:02,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:40:02,654 INFO L681 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-02-21 03:40:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 15362 transitions. [2022-02-21 03:40:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2022-02-21 03:40:02,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:40:02,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10242 states and 15362 transitions. Second operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 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:02,795 INFO L74 IsIncluded]: Start isIncluded. First operand 10242 states and 15362 transitions. Second operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 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:02,805 INFO L87 Difference]: Start difference. First operand 10242 states and 15362 transitions. Second operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 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,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:05,078 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2022-02-21 03:40:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 10242 states and 15362 transitions. [2022-02-21 03:40:05,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:05,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:05,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 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 10242 states and 15362 transitions. [2022-02-21 03:40:05,136 INFO L87 Difference]: Start difference. First operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 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 10242 states and 15362 transitions. [2022-02-21 03:40:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:08,415 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2022-02-21 03:40:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 10242 states and 15362 transitions. [2022-02-21 03:40:08,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:08,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:08,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:40:08,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:40:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 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:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 15362 transitions. [2022-02-21 03:40:11,332 INFO L704 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-02-21 03:40:11,332 INFO L587 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-02-21 03:40:11,332 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:40:11,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 15362 transitions. [2022-02-21 03:40:11,359 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-02-21 03:40:11,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:40:11,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:40:11,360 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:40:11,360 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] [2022-02-21 03:40:11,360 INFO L791 eck$LassoCheckResult]: Stem: 52087#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); 52067#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_~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_~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;havoc main_~cond~0#1; 52068#L211-1 [2022-02-21 03:40:11,361 INFO L793 eck$LassoCheckResult]: Loop: 52068#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 52926#L55 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; 52922#L88 assume !(0 != main_~p1~0#1); 52918#L88-2 assume !(0 != main_~p2~0#1); 52916#L92-1 assume !(0 != main_~p3~0#1); 52914#L96-1 assume !(0 != main_~p4~0#1); 52910#L100-1 assume !(0 != main_~p5~0#1); 52907#L104-1 assume !(0 != main_~p6~0#1); 52908#L108-1 assume !(0 != main_~p7~0#1); 52999#L112-1 assume !(0 != main_~p8~0#1); 52995#L116-1 assume !(0 != main_~p9~0#1); 52992#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 52990#L124-1 assume !(0 != main_~p11~0#1); 52988#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 52985#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 52983#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 52979#L140-1 assume !(0 != main_~p1~0#1); 52975#L146-1 assume !(0 != main_~p2~0#1); 52972#L151-1 assume !(0 != main_~p3~0#1); 52967#L156-1 assume !(0 != main_~p4~0#1); 52962#L161-1 assume !(0 != main_~p5~0#1); 52959#L166-1 assume !(0 != main_~p6~0#1); 52957#L171-1 assume !(0 != main_~p7~0#1); 52953#L176-1 assume !(0 != main_~p8~0#1); 52949#L181-1 assume !(0 != main_~p9~0#1); 52945#L186-1 assume !(0 != main_~p10~0#1); 52942#L191-1 assume !(0 != main_~p11~0#1); 52938#L196-1 assume !(0 != main_~p12~0#1); 52934#L201-1 assume !(0 != main_~p13~0#1); 52930#L206-1 assume !(0 != main_~p14~0#1); 52068#L211-1 [2022-02-21 03:40:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-02-21 03:40:11,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:11,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771706254] [2022-02-21 03:40:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:11,367 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:40:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:40:11,369 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:40:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:40:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash 660190713, now seen corresponding path program 1 times [2022-02-21 03:40:11,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:40:11,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783632335] [2022-02-21 03:40:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:40:11,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:40:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:40:11,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {82783#true} assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {82783#true} is VALID [2022-02-21 03:40:11,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {82783#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; {82783#true} is VALID [2022-02-21 03:40:11,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {82783#true} assume !(0 != main_~p1~0#1); {82783#true} is VALID [2022-02-21 03:40:11,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {82783#true} assume !(0 != main_~p2~0#1); {82783#true} is VALID [2022-02-21 03:40:11,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {82783#true} assume !(0 != main_~p3~0#1); {82783#true} is VALID [2022-02-21 03:40:11,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {82783#true} assume !(0 != main_~p4~0#1); {82783#true} is VALID [2022-02-21 03:40:11,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {82783#true} assume !(0 != main_~p5~0#1); {82783#true} is VALID [2022-02-21 03:40:11,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {82783#true} assume !(0 != main_~p6~0#1); {82783#true} is VALID [2022-02-21 03:40:11,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {82783#true} assume !(0 != main_~p7~0#1); {82783#true} is VALID [2022-02-21 03:40:11,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {82783#true} assume !(0 != main_~p8~0#1); {82783#true} is VALID [2022-02-21 03:40:11,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {82783#true} assume !(0 != main_~p9~0#1); {82783#true} is VALID [2022-02-21 03:40:11,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {82783#true} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p11~0#1); {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p1~0#1); {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p2~0#1); {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p3~0#1); {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p4~0#1); {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p5~0#1); {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p6~0#1); {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p7~0#1); {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p8~0#1); {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p9~0#1); {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:40:11,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {82785#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p10~0#1); {82784#false} is VALID [2022-02-21 03:40:11,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {82784#false} assume !(0 != main_~p11~0#1); {82784#false} is VALID [2022-02-21 03:40:11,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {82784#false} assume !(0 != main_~p12~0#1); {82784#false} is VALID [2022-02-21 03:40:11,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {82784#false} assume !(0 != main_~p13~0#1); {82784#false} is VALID [2022-02-21 03:40:11,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {82784#false} assume !(0 != main_~p14~0#1); {82784#false} is VALID [2022-02-21 03:40:11,391 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:11,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:40:11,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783632335] [2022-02-21 03:40:11,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783632335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:40:11,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:40:11,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:40:11,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37972965] [2022-02-21 03:40:11,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:40:11,392 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:40:11,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:40:11,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:40:11,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:40:11,393 INFO L87 Difference]: Start difference. First operand 10242 states and 15362 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:20,958 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2022-02-21 03:40:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:40:20,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:40:20,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 29954 transitions. [2022-02-21 03:40:31,801 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2022-02-21 03:40:41,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 29954 transitions. [2022-02-21 03:40:41,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2022-02-21 03:40:41,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2022-02-21 03:40:41,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 29954 transitions. [2022-02-21 03:40:41,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:40:41,804 INFO L681 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2022-02-21 03:40:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 29954 transitions. [2022-02-21 03:40:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2022-02-21 03:40:42,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:40:42,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20226 states and 29954 transitions. Second operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 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:42,126 INFO L74 IsIncluded]: Start isIncluded. First operand 20226 states and 29954 transitions. Second operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 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:42,141 INFO L87 Difference]: Start difference. First operand 20226 states and 29954 transitions. Second operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 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:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:40:51,991 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2022-02-21 03:40:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 20226 states and 29954 transitions. [2022-02-21 03:40:52,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:40:52,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:40:52,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 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 20226 states and 29954 transitions. [2022-02-21 03:40:52,045 INFO L87 Difference]: Start difference. First operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 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 20226 states and 29954 transitions. [2022-02-21 03:41:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:41:01,102 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2022-02-21 03:41:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 20226 states and 29954 transitions. [2022-02-21 03:41:01,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:41:01,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:41:01,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:41:01,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:41:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 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)