./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_13.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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:29:46,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:29:46,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:29:46,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:29:46,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:29:46,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:29:46,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:29:46,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:29:46,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:29:46,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:29:46,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:29:46,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:29:46,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:29:46,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:29:46,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:29:46,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:29:46,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:29:46,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:29:46,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:29:46,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:29:46,737 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:29:46,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:29:46,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:29:46,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:29:46,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:29:46,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:29:46,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:29:46,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:29:46,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:29:46,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:29:46,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:29:46,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:29:46,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:29:46,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:29:46,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:29:46,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:29:46,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:29:46,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:29:46,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:29:46,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:29:46,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:29:46,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:29:46,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:29:46,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:29:46,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:29:46,792 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:29:46,792 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:29:46,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:29:46,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:29:46,794 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:29:46,794 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:29:46,794 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:29:46,795 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:29:46,795 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:29:46,795 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:29:46,795 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:29:46,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:29:46,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:29:46,796 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:29:46,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:29:46,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:29:46,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:29:46,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:29:46,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:29:46,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:29:46,797 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:29:46,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:29:46,798 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:29:46,798 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:29:46,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:29:46,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:29:46,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:29:46,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:29:46,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:29:46,800 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:29:46,800 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2022-07-13 03:29:47,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:29:47,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:29:47,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:29:47,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:29:47,059 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:29:47,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2022-07-13 03:29:47,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab6a07c4/b667a3cf391b4c40b3f1970da611cd25/FLAGb9e133a45 [2022-07-13 03:29:47,465 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:29:47,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2022-07-13 03:29:47,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab6a07c4/b667a3cf391b4c40b3f1970da611cd25/FLAGb9e133a45 [2022-07-13 03:29:47,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab6a07c4/b667a3cf391b4c40b3f1970da611cd25 [2022-07-13 03:29:47,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:29:47,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:29:47,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:29:47,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:29:47,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:29:47,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:47" (1/1) ... [2022-07-13 03:29:47,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d45070e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:47, skipping insertion in model container [2022-07-13 03:29:47,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:47" (1/1) ... [2022-07-13 03:29:47,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:29:47,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:29:48,025 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_13.c[4936,4949] [2022-07-13 03:29:48,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:29:48,038 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:29:48,074 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_13.c[4936,4949] [2022-07-13 03:29:48,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:29:48,086 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:29:48,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48 WrapperNode [2022-07-13 03:29:48,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:29:48,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:29:48,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:29:48,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:29:48,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,129 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 157 [2022-07-13 03:29:48,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:29:48,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:29:48,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:29:48,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:29:48,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:29:48,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:29:48,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:29:48,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:29:48,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (1/1) ... [2022-07-13 03:29:48,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:29:48,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:29:48,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:29:48,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:29:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:29:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:29:48,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:29:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:29:48,311 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:29:48,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:29:48,483 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:29:48,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:29:48,488 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 03:29:48,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:48 BoogieIcfgContainer [2022-07-13 03:29:48,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:29:48,490 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:29:48,491 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:29:48,493 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:29:48,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:48,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:29:47" (1/3) ... [2022-07-13 03:29:48,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35fa2aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:29:48, skipping insertion in model container [2022-07-13 03:29:48,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:48,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:48" (2/3) ... [2022-07-13 03:29:48,506 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35fa2aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:29:48, skipping insertion in model container [2022-07-13 03:29:48,506 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:48,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:48" (3/3) ... [2022-07-13 03:29:48,507 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2022-07-13 03:29:48,568 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:29:48,568 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:29:48,568 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:29:48,568 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:29:48,568 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:29:48,588 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:29:48,588 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:29:48,588 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:29:48,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:48,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2022-07-13 03:29:48,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:48,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:48,614 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:48,615 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:48,615 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:29:48,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:48,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2022-07-13 03:29:48,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:48,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:48,619 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:48,619 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:48,623 INFO L752 eck$LassoCheckResult]: Stem: 22#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(16, 2);call #Ultimate.allocInit(12, 3); 6#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_~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_~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;havoc main_~cond~0#1; 13#L197-1true [2022-07-13 03:29:48,624 INFO L754 eck$LassoCheckResult]: Loop: 13#L197-1true assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 43#L52true 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; 28#L83true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 15#L83-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 9#L87-1true assume !(0 != main_~p3~0#1); 3#L91-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 45#L95-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 16#L99-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 10#L103-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 25#L107-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 14#L111-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 32#L115-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 34#L119-1true assume !(0 != main_~p11~0#1); 46#L123-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 26#L127-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 35#L131-1true assume !(0 != main_~p1~0#1); 12#L137-1true assume !(0 != main_~p2~0#1); 7#L142-1true assume !(0 != main_~p3~0#1); 36#L147-1true assume !(0 != main_~p4~0#1); 11#L152-1true assume !(0 != main_~p5~0#1); 20#L157-1true assume !(0 != main_~p6~0#1); 17#L162-1true assume !(0 != main_~p7~0#1); 18#L167-1true assume !(0 != main_~p8~0#1); 23#L172-1true assume !(0 != main_~p9~0#1); 31#L177-1true assume !(0 != main_~p10~0#1); 47#L182-1true assume !(0 != main_~p11~0#1); 44#L187-1true assume !(0 != main_~p12~0#1); 38#L192-1true assume !(0 != main_~p13~0#1); 13#L197-1true [2022-07-13 03:29:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:48,629 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:29:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:48,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308498991] [2022-07-13 03:29:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:48,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:48,722 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:48,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:48,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:48,762 INFO L85 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2022-07-13 03:29:48,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:48,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004931909] [2022-07-13 03:29:48,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:48,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:48,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:48,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004931909] [2022-07-13 03:29:48,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004931909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:48,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:48,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:48,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592030799] [2022-07-13 03:29:48,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:48,865 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:48,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:48,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:48,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:48,897 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:48,939 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2022-07-13 03:29:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:48,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 166 transitions. [2022-07-13 03:29:48,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2022-07-13 03:29:48,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 83 states and 133 transitions. [2022-07-13 03:29:48,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2022-07-13 03:29:48,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2022-07-13 03:29:48,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2022-07-13 03:29:48,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:48,972 INFO L369 hiAutomatonCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-07-13 03:29:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2022-07-13 03:29:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-13 03:29:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2022-07-13 03:29:49,002 INFO L392 hiAutomatonCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-07-13 03:29:49,002 INFO L374 stractBuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-07-13 03:29:49,002 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:29:49,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2022-07-13 03:29:49,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2022-07-13 03:29:49,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,009 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,009 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:49,009 INFO L752 eck$LassoCheckResult]: Stem: 181#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(16, 2);call #Ultimate.allocInit(12, 3); 156#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_~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_~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;havoc main_~cond~0#1; 157#L197-1 [2022-07-13 03:29:49,009 INFO L754 eck$LassoCheckResult]: Loop: 157#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 209#L52 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; 208#L83 assume !(0 != main_~p1~0#1); 207#L83-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 206#L87-1 assume !(0 != main_~p3~0#1); 205#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 198#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 174#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 164#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 165#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 202#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 192#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 193#L119-1 assume !(0 != main_~p11~0#1); 201#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 185#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 186#L131-1 assume !(0 != main_~p1~0#1); 200#L137-1 assume !(0 != main_~p2~0#1); 231#L142-1 assume !(0 != main_~p3~0#1); 229#L147-1 assume !(0 != main_~p4~0#1); 227#L152-1 assume !(0 != main_~p5~0#1); 225#L157-1 assume !(0 != main_~p6~0#1); 223#L162-1 assume !(0 != main_~p7~0#1); 221#L167-1 assume !(0 != main_~p8~0#1); 218#L172-1 assume !(0 != main_~p9~0#1); 217#L177-1 assume !(0 != main_~p10~0#1); 215#L182-1 assume !(0 != main_~p11~0#1); 212#L187-1 assume !(0 != main_~p12~0#1); 211#L192-1 assume !(0 != main_~p13~0#1); 157#L197-1 [2022-07-13 03:29:49,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 03:29:49,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944724506] [2022-07-13 03:29:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,025 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2022-07-13 03:29:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416841791] [2022-07-13 03:29:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416841791] [2022-07-13 03:29:49,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416841791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279583770] [2022-07-13 03:29:49,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,080 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,081 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,109 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2022-07-13 03:29:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2022-07-13 03:29:49,113 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2022-07-13 03:29:49,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2022-07-13 03:29:49,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2022-07-13 03:29:49,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2022-07-13 03:29:49,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2022-07-13 03:29:49,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,117 INFO L369 hiAutomatonCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-07-13 03:29:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2022-07-13 03:29:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-13 03:29:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2022-07-13 03:29:49,128 INFO L392 hiAutomatonCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-07-13 03:29:49,128 INFO L374 stractBuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-07-13 03:29:49,128 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:29:49,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2022-07-13 03:29:49,129 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2022-07-13 03:29:49,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,131 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,131 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:49,131 INFO L752 eck$LassoCheckResult]: Stem: 434#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(16, 2);call #Ultimate.allocInit(12, 3); 407#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_~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_~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;havoc main_~cond~0#1; 406#L197-1 [2022-07-13 03:29:49,131 INFO L754 eck$LassoCheckResult]: Loop: 406#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 422#L52 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; 454#L83 assume !(0 != main_~p1~0#1); 515#L83-2 assume !(0 != main_~p2~0#1); 413#L87-1 assume !(0 != main_~p3~0#1); 401#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 402#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 425#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 414#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 415#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 467#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 468#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 463#L119-1 assume !(0 != main_~p11~0#1); 464#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 437#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 438#L131-1 assume !(0 != main_~p1~0#1); 509#L137-1 assume !(0 != main_~p2~0#1); 553#L142-1 assume !(0 != main_~p3~0#1); 551#L147-1 assume !(0 != main_~p4~0#1); 549#L152-1 assume !(0 != main_~p5~0#1); 547#L157-1 assume !(0 != main_~p6~0#1); 545#L162-1 assume !(0 != main_~p7~0#1); 543#L167-1 assume !(0 != main_~p8~0#1); 540#L172-1 assume !(0 != main_~p9~0#1); 539#L177-1 assume !(0 != main_~p10~0#1); 537#L182-1 assume !(0 != main_~p11~0#1); 523#L187-1 assume !(0 != main_~p12~0#1); 451#L192-1 assume !(0 != main_~p13~0#1); 406#L197-1 [2022-07-13 03:29:49,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-13 03:29:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924588306] [2022-07-13 03:29:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2022-07-13 03:29:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317790991] [2022-07-13 03:29:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317790991] [2022-07-13 03:29:49,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317790991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047276563] [2022-07-13 03:29:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,200 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,201 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,223 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2022-07-13 03:29:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2022-07-13 03:29:49,226 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2022-07-13 03:29:49,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2022-07-13 03:29:49,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2022-07-13 03:29:49,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2022-07-13 03:29:49,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2022-07-13 03:29:49,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,233 INFO L369 hiAutomatonCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-07-13 03:29:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2022-07-13 03:29:49,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-07-13 03:29:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2022-07-13 03:29:49,251 INFO L392 hiAutomatonCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-07-13 03:29:49,252 INFO L374 stractBuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-07-13 03:29:49,253 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:29:49,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2022-07-13 03:29:49,254 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2022-07-13 03:29:49,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,255 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,255 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:49,255 INFO L752 eck$LassoCheckResult]: Stem: 920#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(16, 2);call #Ultimate.allocInit(12, 3); 893#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_~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_~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;havoc main_~cond~0#1; 894#L197-1 [2022-07-13 03:29:49,264 INFO L754 eck$LassoCheckResult]: Loop: 894#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 1033#L52 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; 1031#L83 assume !(0 != main_~p1~0#1); 1029#L83-2 assume !(0 != main_~p2~0#1); 1030#L87-1 assume !(0 != main_~p3~0#1); 1101#L91-1 assume !(0 != main_~p4~0#1); 1100#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1097#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1094#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1091#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1088#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1086#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1083#L119-1 assume !(0 != main_~p11~0#1); 1081#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1077#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1073#L131-1 assume !(0 != main_~p1~0#1); 1068#L137-1 assume !(0 != main_~p2~0#1); 1021#L142-1 assume !(0 != main_~p3~0#1); 1020#L147-1 assume !(0 != main_~p4~0#1); 1060#L152-1 assume !(0 != main_~p5~0#1); 1056#L157-1 assume !(0 != main_~p6~0#1); 1052#L162-1 assume !(0 != main_~p7~0#1); 1048#L167-1 assume !(0 != main_~p8~0#1); 1044#L172-1 assume !(0 != main_~p9~0#1); 1042#L177-1 assume !(0 != main_~p10~0#1); 1039#L182-1 assume !(0 != main_~p11~0#1); 1036#L187-1 assume !(0 != main_~p12~0#1); 1035#L192-1 assume !(0 != main_~p13~0#1); 894#L197-1 [2022-07-13 03:29:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-13 03:29:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676258341] [2022-07-13 03:29:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,271 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2022-07-13 03:29:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423286204] [2022-07-13 03:29:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423286204] [2022-07-13 03:29:49,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423286204] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006755939] [2022-07-13 03:29:49,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,318 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,320 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,336 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2022-07-13 03:29:49,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2022-07-13 03:29:49,341 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2022-07-13 03:29:49,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2022-07-13 03:29:49,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2022-07-13 03:29:49,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2022-07-13 03:29:49,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2022-07-13 03:29:49,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,347 INFO L369 hiAutomatonCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-07-13 03:29:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2022-07-13 03:29:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2022-07-13 03:29:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2022-07-13 03:29:49,363 INFO L392 hiAutomatonCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-07-13 03:29:49,363 INFO L374 stractBuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-07-13 03:29:49,363 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:29:49,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2022-07-13 03:29:49,366 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2022-07-13 03:29:49,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,367 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,368 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:49,368 INFO L752 eck$LassoCheckResult]: Stem: 1873#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(16, 2);call #Ultimate.allocInit(12, 3); 1843#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_~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_~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;havoc main_~cond~0#1; 1844#L197-1 [2022-07-13 03:29:49,368 INFO L754 eck$LassoCheckResult]: Loop: 1844#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 1950#L52 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; 1948#L83 assume !(0 != main_~p1~0#1); 1944#L83-2 assume !(0 != main_~p2~0#1); 1942#L87-1 assume !(0 != main_~p3~0#1); 1938#L91-1 assume !(0 != main_~p4~0#1); 1935#L95-1 assume !(0 != main_~p5~0#1); 1933#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1931#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1929#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1927#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1925#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1923#L119-1 assume !(0 != main_~p11~0#1); 1921#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1919#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1916#L131-1 assume !(0 != main_~p1~0#1); 1917#L137-1 assume !(0 != main_~p2~0#1); 1994#L142-1 assume !(0 != main_~p3~0#1); 1989#L147-1 assume !(0 != main_~p4~0#1); 1985#L152-1 assume !(0 != main_~p5~0#1); 1982#L157-1 assume !(0 != main_~p6~0#1); 1978#L162-1 assume !(0 != main_~p7~0#1); 1974#L167-1 assume !(0 != main_~p8~0#1); 1969#L172-1 assume !(0 != main_~p9~0#1); 1966#L177-1 assume !(0 != main_~p10~0#1); 1962#L182-1 assume !(0 != main_~p11~0#1); 1957#L187-1 assume !(0 != main_~p12~0#1); 1954#L192-1 assume !(0 != main_~p13~0#1); 1844#L197-1 [2022-07-13 03:29:49,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,368 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-13 03:29:49,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585447661] [2022-07-13 03:29:49,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,375 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2022-07-13 03:29:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871427372] [2022-07-13 03:29:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871427372] [2022-07-13 03:29:49,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871427372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101095818] [2022-07-13 03:29:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,429 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,430 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,441 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2022-07-13 03:29:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2022-07-13 03:29:49,448 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2022-07-13 03:29:49,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2022-07-13 03:29:49,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2022-07-13 03:29:49,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2022-07-13 03:29:49,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2022-07-13 03:29:49,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,455 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-07-13 03:29:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2022-07-13 03:29:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2022-07-13 03:29:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2022-07-13 03:29:49,471 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-07-13 03:29:49,471 INFO L374 stractBuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-07-13 03:29:49,471 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:29:49,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2022-07-13 03:29:49,482 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2022-07-13 03:29:49,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,484 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,484 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:49,484 INFO L752 eck$LassoCheckResult]: Stem: 3735#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(16, 2);call #Ultimate.allocInit(12, 3); 3709#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_~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_~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;havoc main_~cond~0#1; 3710#L197-1 [2022-07-13 03:29:49,484 INFO L754 eck$LassoCheckResult]: Loop: 3710#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 3841#L52 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; 3837#L83 assume !(0 != main_~p1~0#1); 3830#L83-2 assume !(0 != main_~p2~0#1); 3825#L87-1 assume !(0 != main_~p3~0#1); 3818#L91-1 assume !(0 != main_~p4~0#1); 3810#L95-1 assume !(0 != main_~p5~0#1); 3804#L99-1 assume !(0 != main_~p6~0#1); 3799#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3796#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3793#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3790#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3787#L119-1 assume !(0 != main_~p11~0#1); 3784#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3780#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 3781#L131-1 assume !(0 != main_~p1~0#1); 3908#L137-1 assume !(0 != main_~p2~0#1); 3904#L142-1 assume !(0 != main_~p3~0#1); 3894#L147-1 assume !(0 != main_~p4~0#1); 3889#L152-1 assume !(0 != main_~p5~0#1); 3887#L157-1 assume !(0 != main_~p6~0#1); 3886#L162-1 assume !(0 != main_~p7~0#1); 3884#L167-1 assume !(0 != main_~p8~0#1); 3877#L172-1 assume !(0 != main_~p9~0#1); 3866#L177-1 assume !(0 != main_~p10~0#1); 3858#L182-1 assume !(0 != main_~p11~0#1); 3853#L187-1 assume !(0 != main_~p12~0#1); 3850#L192-1 assume !(0 != main_~p13~0#1); 3710#L197-1 [2022-07-13 03:29:49,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,484 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-13 03:29:49,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792704353] [2022-07-13 03:29:49,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,489 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,498 INFO L85 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2022-07-13 03:29:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714723971] [2022-07-13 03:29:49,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714723971] [2022-07-13 03:29:49,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714723971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669289601] [2022-07-13 03:29:49,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,527 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,528 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,547 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2022-07-13 03:29:49,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2022-07-13 03:29:49,578 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2022-07-13 03:29:49,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2022-07-13 03:29:49,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2022-07-13 03:29:49,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2022-07-13 03:29:49,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2022-07-13 03:29:49,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,599 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-07-13 03:29:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2022-07-13 03:29:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2022-07-13 03:29:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2022-07-13 03:29:49,662 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-07-13 03:29:49,665 INFO L374 stractBuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-07-13 03:29:49,665 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:29:49,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2022-07-13 03:29:49,675 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2022-07-13 03:29:49,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,675 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,675 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:49,676 INFO L752 eck$LassoCheckResult]: Stem: 7410#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(16, 2);call #Ultimate.allocInit(12, 3); 7383#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_~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_~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;havoc main_~cond~0#1; 7384#L197-1 [2022-07-13 03:29:49,676 INFO L754 eck$LassoCheckResult]: Loop: 7384#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 7625#L52 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; 7624#L83 assume !(0 != main_~p1~0#1); 7593#L83-2 assume !(0 != main_~p2~0#1); 7590#L87-1 assume !(0 != main_~p3~0#1); 7582#L91-1 assume !(0 != main_~p4~0#1); 7531#L95-1 assume !(0 != main_~p5~0#1); 7490#L99-1 assume !(0 != main_~p6~0#1); 7491#L103-1 assume !(0 != main_~p7~0#1); 7731#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 7726#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7724#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 7722#L119-1 assume !(0 != main_~p11~0#1); 7718#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7712#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 7705#L131-1 assume !(0 != main_~p1~0#1); 7654#L137-1 assume !(0 != main_~p2~0#1); 7651#L142-1 assume !(0 != main_~p3~0#1); 7648#L147-1 assume !(0 != main_~p4~0#1); 7646#L152-1 assume !(0 != main_~p5~0#1); 7644#L157-1 assume !(0 != main_~p6~0#1); 7642#L162-1 assume !(0 != main_~p7~0#1); 7641#L167-1 assume !(0 != main_~p8~0#1); 7638#L172-1 assume !(0 != main_~p9~0#1); 7637#L177-1 assume !(0 != main_~p10~0#1); 7635#L182-1 assume !(0 != main_~p11~0#1); 7632#L187-1 assume !(0 != main_~p12~0#1); 7631#L192-1 assume !(0 != main_~p13~0#1); 7384#L197-1 [2022-07-13 03:29:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-07-13 03:29:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795411259] [2022-07-13 03:29:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2022-07-13 03:29:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429420188] [2022-07-13 03:29:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:49,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429420188] [2022-07-13 03:29:49,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429420188] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:49,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:49,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65891409] [2022-07-13 03:29:49,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:49,723 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:49,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:49,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:49,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:49,724 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:49,755 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2022-07-13 03:29:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:49,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2022-07-13 03:29:49,790 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2022-07-13 03:29:49,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2022-07-13 03:29:49,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2022-07-13 03:29:49,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2022-07-13 03:29:49,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2022-07-13 03:29:49,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:49,818 INFO L369 hiAutomatonCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-07-13 03:29:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2022-07-13 03:29:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2022-07-13 03:29:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2022-07-13 03:29:49,940 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-07-13 03:29:49,940 INFO L374 stractBuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-07-13 03:29:49,940 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:29:49,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2022-07-13 03:29:49,962 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2022-07-13 03:29:49,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:49,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:49,964 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:49,964 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:49,964 INFO L752 eck$LassoCheckResult]: Stem: 14651#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(16, 2);call #Ultimate.allocInit(12, 3); 14625#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_~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_~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;havoc main_~cond~0#1; 14626#L197-1 [2022-07-13 03:29:49,965 INFO L754 eck$LassoCheckResult]: Loop: 14626#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 15042#L52 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; 15039#L83 assume !(0 != main_~p1~0#1); 15035#L83-2 assume !(0 != main_~p2~0#1); 15032#L87-1 assume !(0 != main_~p3~0#1); 15029#L91-1 assume !(0 != main_~p4~0#1); 15025#L95-1 assume !(0 != main_~p5~0#1); 15021#L99-1 assume !(0 != main_~p6~0#1); 15022#L103-1 assume !(0 != main_~p7~0#1); 15100#L107-1 assume !(0 != main_~p8~0#1); 15098#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 15096#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 15094#L119-1 assume !(0 != main_~p11~0#1); 15092#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 15090#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 15087#L131-1 assume !(0 != main_~p1~0#1); 15083#L137-1 assume !(0 != main_~p2~0#1); 15080#L142-1 assume !(0 != main_~p3~0#1); 15075#L147-1 assume !(0 != main_~p4~0#1); 15071#L152-1 assume !(0 != main_~p5~0#1); 15069#L157-1 assume !(0 != main_~p6~0#1); 15068#L162-1 assume !(0 != main_~p7~0#1); 15066#L167-1 assume !(0 != main_~p8~0#1); 15062#L172-1 assume !(0 != main_~p9~0#1); 15059#L177-1 assume !(0 != main_~p10~0#1); 15055#L182-1 assume !(0 != main_~p11~0#1); 15050#L187-1 assume !(0 != main_~p12~0#1); 15047#L192-1 assume !(0 != main_~p13~0#1); 14626#L197-1 [2022-07-13 03:29:49,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,965 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-07-13 03:29:49,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179374164] [2022-07-13 03:29:49,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,972 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:49,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2022-07-13 03:29:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:49,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560865286] [2022-07-13 03:29:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:49,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:50,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:50,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560865286] [2022-07-13 03:29:50,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560865286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:50,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:50,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014675457] [2022-07-13 03:29:50,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:50,018 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:50,019 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:50,053 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2022-07-13 03:29:50,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:50,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2022-07-13 03:29:50,104 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2022-07-13 03:29:50,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2022-07-13 03:29:50,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2022-07-13 03:29:50,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2022-07-13 03:29:50,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2022-07-13 03:29:50,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:50,226 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-07-13 03:29:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2022-07-13 03:29:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2022-07-13 03:29:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2022-07-13 03:29:50,392 INFO L392 hiAutomatonCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-07-13 03:29:50,392 INFO L374 stractBuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-07-13 03:29:50,392 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 03:29:50,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2022-07-13 03:29:50,418 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2022-07-13 03:29:50,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:50,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:50,421 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:50,421 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:50,421 INFO L752 eck$LassoCheckResult]: Stem: 28933#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(16, 2);call #Ultimate.allocInit(12, 3); 28907#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_~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_~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;havoc main_~cond~0#1; 28908#L197-1 [2022-07-13 03:29:50,423 INFO L754 eck$LassoCheckResult]: Loop: 28908#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 29641#L52 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; 29642#L83 assume !(0 != main_~p1~0#1); 29625#L83-2 assume !(0 != main_~p2~0#1); 29627#L87-1 assume !(0 != main_~p3~0#1); 29609#L91-1 assume !(0 != main_~p4~0#1); 29611#L95-1 assume !(0 != main_~p5~0#1); 29776#L99-1 assume !(0 != main_~p6~0#1); 29773#L103-1 assume !(0 != main_~p7~0#1); 29769#L107-1 assume !(0 != main_~p8~0#1); 29762#L111-1 assume !(0 != main_~p9~0#1); 29757#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 29753#L119-1 assume !(0 != main_~p11~0#1); 29749#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 29745#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 29738#L131-1 assume !(0 != main_~p1~0#1); 29728#L137-1 assume !(0 != main_~p2~0#1); 29722#L142-1 assume !(0 != main_~p3~0#1); 29714#L147-1 assume !(0 != main_~p4~0#1); 29710#L152-1 assume !(0 != main_~p5~0#1); 29421#L157-1 assume !(0 != main_~p6~0#1); 29423#L162-1 assume !(0 != main_~p7~0#1); 29693#L167-1 assume !(0 != main_~p8~0#1); 29694#L172-1 assume !(0 != main_~p9~0#1); 29684#L177-1 assume !(0 != main_~p10~0#1); 29683#L182-1 assume !(0 != main_~p11~0#1); 29788#L187-1 assume !(0 != main_~p12~0#1); 29656#L192-1 assume !(0 != main_~p13~0#1); 28908#L197-1 [2022-07-13 03:29:50,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-07-13 03:29:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055490593] [2022-07-13 03:29:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,428 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,434 INFO L85 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2022-07-13 03:29:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74782364] [2022-07-13 03:29:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:50,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:50,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74782364] [2022-07-13 03:29:50,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74782364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:50,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:50,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567435688] [2022-07-13 03:29:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:50,457 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:50,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:50,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:50,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:50,458 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:50,570 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2022-07-13 03:29:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:50,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2022-07-13 03:29:50,716 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2022-07-13 03:29:50,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2022-07-13 03:29:50,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2022-07-13 03:29:50,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2022-07-13 03:29:50,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2022-07-13 03:29:50,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:50,816 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-07-13 03:29:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2022-07-13 03:29:51,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2022-07-13 03:29:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2022-07-13 03:29:51,113 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-07-13 03:29:51,113 INFO L374 stractBuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-07-13 03:29:51,113 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-13 03:29:51,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2022-07-13 03:29:51,169 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2022-07-13 03:29:51,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:51,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:51,169 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:51,169 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:51,170 INFO L752 eck$LassoCheckResult]: Stem: 57107#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(16, 2);call #Ultimate.allocInit(12, 3); 57077#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_~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_~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;havoc main_~cond~0#1; 57078#L197-1 [2022-07-13 03:29:51,170 INFO L754 eck$LassoCheckResult]: Loop: 57078#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 57248#L52 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; 57244#L83 assume !(0 != main_~p1~0#1); 57241#L83-2 assume !(0 != main_~p2~0#1); 57238#L87-1 assume !(0 != main_~p3~0#1); 57234#L91-1 assume !(0 != main_~p4~0#1); 57230#L95-1 assume !(0 != main_~p5~0#1); 57226#L99-1 assume !(0 != main_~p6~0#1); 57221#L103-1 assume !(0 != main_~p7~0#1); 57216#L107-1 assume !(0 != main_~p8~0#1); 57217#L111-1 assume !(0 != main_~p9~0#1); 57538#L115-1 assume !(0 != main_~p10~0#1); 57534#L119-1 assume !(0 != main_~p11~0#1); 57530#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 57526#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 57519#L131-1 assume !(0 != main_~p1~0#1); 57512#L137-1 assume !(0 != main_~p2~0#1); 57494#L142-1 assume !(0 != main_~p3~0#1); 57475#L147-1 assume !(0 != main_~p4~0#1); 57471#L152-1 assume !(0 != main_~p5~0#1); 57467#L157-1 assume !(0 != main_~p6~0#1); 57465#L162-1 assume !(0 != main_~p7~0#1); 57453#L167-1 assume !(0 != main_~p8~0#1); 57451#L172-1 assume !(0 != main_~p9~0#1); 57450#L177-1 assume !(0 != main_~p10~0#1); 57449#L182-1 assume !(0 != main_~p11~0#1); 57253#L187-1 assume !(0 != main_~p12~0#1); 57252#L192-1 assume !(0 != main_~p13~0#1); 57078#L197-1 [2022-07-13 03:29:51,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-07-13 03:29:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386734316] [2022-07-13 03:29:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,173 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2022-07-13 03:29:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359055586] [2022-07-13 03:29:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:51,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:51,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359055586] [2022-07-13 03:29:51,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359055586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:51,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:51,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:51,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872179639] [2022-07-13 03:29:51,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:51,187 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:51,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:51,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:51,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:51,188 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:51,392 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2022-07-13 03:29:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:51,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2022-07-13 03:29:51,612 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2022-07-13 03:29:51,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2022-07-13 03:29:51,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2022-07-13 03:29:51,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2022-07-13 03:29:51,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2022-07-13 03:29:51,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:51,774 INFO L369 hiAutomatonCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2022-07-13 03:29:51,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2022-07-13 03:29:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2022-07-13 03:29:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36866 states, 36866 states have (on average 1.4444203330982477) internal successors, (53250), 36865 states have internal predecessors, (53250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2022-07-13 03:29:52,276 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2022-07-13 03:29:52,276 INFO L374 stractBuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2022-07-13 03:29:52,276 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-13 03:29:52,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2022-07-13 03:29:52,392 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2022-07-13 03:29:52,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:52,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:52,393 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:52,393 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:52,394 INFO L752 eck$LassoCheckResult]: Stem: 112669#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(16, 2);call #Ultimate.allocInit(12, 3); 112639#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_~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_~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;havoc main_~cond~0#1; 112640#L197-1 [2022-07-13 03:29:52,394 INFO L754 eck$LassoCheckResult]: Loop: 112640#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 113657#L52 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; 113653#L83 assume !(0 != main_~p1~0#1); 113649#L83-2 assume !(0 != main_~p2~0#1); 113647#L87-1 assume !(0 != main_~p3~0#1); 113643#L91-1 assume !(0 != main_~p4~0#1); 113639#L95-1 assume !(0 != main_~p5~0#1); 113635#L99-1 assume !(0 != main_~p6~0#1); 113631#L103-1 assume !(0 != main_~p7~0#1); 113627#L107-1 assume !(0 != main_~p8~0#1); 113623#L111-1 assume !(0 != main_~p9~0#1); 113624#L115-1 assume !(0 != main_~p10~0#1); 113702#L119-1 assume !(0 != main_~p11~0#1); 113699#L123-1 assume !(0 != main_~p12~0#1); 113697#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 113695#L131-1 assume !(0 != main_~p1~0#1); 113693#L137-1 assume !(0 != main_~p2~0#1); 113681#L142-1 assume !(0 != main_~p3~0#1); 113675#L147-1 assume !(0 != main_~p4~0#1); 113544#L152-1 assume !(0 != main_~p5~0#1); 113545#L157-1 assume !(0 != main_~p6~0#1); 113491#L162-1 assume !(0 != main_~p7~0#1); 113493#L167-1 assume !(0 != main_~p8~0#1); 113427#L172-1 assume !(0 != main_~p9~0#1); 113428#L177-1 assume !(0 != main_~p10~0#1); 113669#L182-1 assume !(0 != main_~p11~0#1); 113664#L187-1 assume !(0 != main_~p12~0#1); 113661#L192-1 assume !(0 != main_~p13~0#1); 112640#L197-1 [2022-07-13 03:29:52,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:52,394 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-07-13 03:29:52,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:52,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416606111] [2022-07-13 03:29:52,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:52,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:52,397 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:52,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:52,400 INFO L85 PathProgramCache]: Analyzing trace with hash 463639801, now seen corresponding path program 1 times [2022-07-13 03:29:52,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:52,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573999768] [2022-07-13 03:29:52,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:52,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:52,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:52,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573999768] [2022-07-13 03:29:52,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573999768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:52,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:52,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:29:52,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023061433] [2022-07-13 03:29:52,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:52,412 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:52,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:52,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:52,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:52,413 INFO L87 Difference]: Start difference. First operand 36866 states and 53250 transitions. cyclomatic complexity: 17408 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:52,721 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2022-07-13 03:29:52,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:52,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2022-07-13 03:29:53,130 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2022-07-13 03:29:53,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2022-07-13 03:29:53,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2022-07-13 03:29:53,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2022-07-13 03:29:53,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2022-07-13 03:29:53,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:53,460 INFO L369 hiAutomatonCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2022-07-13 03:29:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2022-07-13 03:29:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2022-07-13 03:29:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72706 states, 72706 states have (on average 1.4225235881495337) internal successors, (103426), 72705 states have internal predecessors, (103426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2022-07-13 03:29:54,475 INFO L392 hiAutomatonCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2022-07-13 03:29:54,475 INFO L374 stractBuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2022-07-13 03:29:54,475 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-13 03:29:54,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2022-07-13 03:29:54,751 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2022-07-13 03:29:54,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:54,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:54,753 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:54,753 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:54,753 INFO L752 eck$LassoCheckResult]: Stem: 222245#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(16, 2);call #Ultimate.allocInit(12, 3); 222217#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_~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_~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;havoc main_~cond~0#1; 222218#L197-1 [2022-07-13 03:29:54,753 INFO L754 eck$LassoCheckResult]: Loop: 222218#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 223381#L52 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; 223379#L83 assume !(0 != main_~p1~0#1); 223377#L83-2 assume !(0 != main_~p2~0#1); 223376#L87-1 assume !(0 != main_~p3~0#1); 223374#L91-1 assume !(0 != main_~p4~0#1); 223372#L95-1 assume !(0 != main_~p5~0#1); 223370#L99-1 assume !(0 != main_~p6~0#1); 223368#L103-1 assume !(0 != main_~p7~0#1); 223366#L107-1 assume !(0 != main_~p8~0#1); 223364#L111-1 assume !(0 != main_~p9~0#1); 223362#L115-1 assume !(0 != main_~p10~0#1); 223360#L119-1 assume !(0 != main_~p11~0#1); 223357#L123-1 assume !(0 != main_~p12~0#1); 223358#L127-1 assume !(0 != main_~p13~0#1); 223341#L131-1 assume !(0 != main_~p1~0#1); 223343#L137-1 assume !(0 != main_~p2~0#1); 223327#L142-1 assume !(0 != main_~p3~0#1); 223326#L147-1 assume !(0 != main_~p4~0#1); 223309#L152-1 assume !(0 != main_~p5~0#1); 223310#L157-1 assume !(0 != main_~p6~0#1); 223291#L162-1 assume !(0 != main_~p7~0#1); 223293#L167-1 assume !(0 != main_~p8~0#1); 223278#L172-1 assume !(0 != main_~p9~0#1); 223279#L177-1 assume !(0 != main_~p10~0#1); 223267#L182-1 assume !(0 != main_~p11~0#1); 223266#L187-1 assume !(0 != main_~p12~0#1); 223382#L192-1 assume !(0 != main_~p13~0#1); 222218#L197-1 [2022-07-13 03:29:54,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:54,753 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2022-07-13 03:29:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:54,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335434683] [2022-07-13 03:29:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:54,756 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:54,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:54,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash -547477449, now seen corresponding path program 1 times [2022-07-13 03:29:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:54,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628583807] [2022-07-13 03:29:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:54,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:54,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:54,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash 496424185, now seen corresponding path program 1 times [2022-07-13 03:29:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:54,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255062557] [2022-07-13 03:29:54,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:54,774 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:54,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:55,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:29:55 BoogieIcfgContainer [2022-07-13 03:29:55,082 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:29:55,083 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:29:55,083 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:29:55,083 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:29:55,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:48" (3/4) ... [2022-07-13 03:29:55,085 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 03:29:55,117 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 03:29:55,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:29:55,118 INFO L158 Benchmark]: Toolchain (without parser) took 7264.12ms. Allocated memory was 100.7MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 75.7MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 607.1MB. Max. memory is 16.1GB. [2022-07-13 03:29:55,118 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:29:55,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.66ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 64.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:29:55,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.99ms. Allocated memory is still 100.7MB. Free memory was 64.5MB in the beginning and 62.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:29:55,119 INFO L158 Benchmark]: Boogie Preprocessor took 37.21ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 61.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:29:55,119 INFO L158 Benchmark]: RCFGBuilder took 322.18ms. Allocated memory is still 100.7MB. Free memory was 61.3MB in the beginning and 49.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 03:29:55,120 INFO L158 Benchmark]: BuchiAutomizer took 6591.83ms. Allocated memory was 100.7MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 49.1MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 577.7MB. Max. memory is 16.1GB. [2022-07-13 03:29:55,120 INFO L158 Benchmark]: Witness Printer took 34.91ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:29:55,121 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.66ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 64.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.99ms. Allocated memory is still 100.7MB. Free memory was 64.5MB in the beginning and 62.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.21ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 61.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 322.18ms. Allocated memory is still 100.7MB. Free memory was 61.3MB in the beginning and 49.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6591.83ms. Allocated memory was 100.7MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 49.1MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 577.7MB. Max. memory is 16.1GB. * Witness Printer took 34.91ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72706 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 589 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 589 mSDsluCounter, 1842 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 709 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1133 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 50]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p11=0, p13=0, lk5=0, p1=0, NULL=0, lk13=0, p9=0, lk9=0, NULL=1, lk12=0, cond=4, p5=0, p12=0, p10=0, lk2=0, p4=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f91b913=0, lk11=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c55267f=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e90d105=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37115e0d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4dafd9be=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b923adc=0, \result=0, lk10=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64bf9e96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46c4ea33=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a321440=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59e35291=0, p2=0, lk4=0, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67c9b63a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63d4d82=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3cae66bf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f1adc61=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 50]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-13 03:29:55,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)