./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-19 17:58:12,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 17:58:12,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 17:58:12,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 17:58:12,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 17:58:12,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 17:58:12,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 17:58:12,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 17:58:12,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 17:58:12,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 17:58:12,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 17:58:12,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 17:58:12,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 17:58:12,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 17:58:12,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 17:58:12,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 17:58:12,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 17:58:12,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 17:58:12,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 17:58:12,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 17:58:12,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 17:58:12,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 17:58:12,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 17:58:12,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 17:58:12,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 17:58:12,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 17:58:12,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 17:58:12,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 17:58:12,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 17:58:12,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 17:58:12,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 17:58:12,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 17:58:12,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 17:58:12,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 17:58:12,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 17:58:12,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 17:58:12,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 17:58:12,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 17:58:12,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 17:58:12,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 17:58:12,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 17:58:12,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-19 17:58:12,860 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 17:58:12,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 17:58:12,860 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 17:58:12,860 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 17:58:12,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 17:58:12,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 17:58:12,861 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 17:58:12,861 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 17:58:12,861 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 17:58:12,861 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 17:58:12,862 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 17:58:12,862 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 17:58:12,862 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 17:58:12,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 17:58:12,862 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 17:58:12,862 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 17:58:12,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 17:58:12,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 17:58:12,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 17:58:12,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 17:58:12,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 17:58:12,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 17:58:12,863 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 17:58:12,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 17:58:12,863 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 17:58:12,865 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 17:58:12,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 17:58:12,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 17:58:12,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 17:58:12,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 17:58:12,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 17:58:12,866 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 17:58:12,866 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 17:58:12,867 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 [2021-12-19 17:58:13,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 17:58:13,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 17:58:13,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 17:58:13,086 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 17:58:13,086 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 17:58:13,087 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2021-12-19 17:58:13,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd61e6c0b/bea14366bea24b26800f84417a9d1d9b/FLAG66cc4fc37 [2021-12-19 17:58:13,528 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 17:58:13,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2021-12-19 17:58:13,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd61e6c0b/bea14366bea24b26800f84417a9d1d9b/FLAG66cc4fc37 [2021-12-19 17:58:13,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd61e6c0b/bea14366bea24b26800f84417a9d1d9b [2021-12-19 17:58:13,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 17:58:13,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 17:58:13,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 17:58:13,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 17:58:13,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 17:58:13,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:58:13" (1/1) ... [2021-12-19 17:58:13,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b1a571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:13, skipping insertion in model container [2021-12-19 17:58:13,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:58:13" (1/1) ... [2021-12-19 17:58:13,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 17:58:13,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 17:58:14,137 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] [2021-12-19 17:58:14,139 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:58:14,144 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 17:58:14,178 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] [2021-12-19 17:58:14,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:58:14,192 INFO L208 MainTranslator]: Completed translation [2021-12-19 17:58:14,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14 WrapperNode [2021-12-19 17:58:14,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 17:58:14,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 17:58:14,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 17:58:14,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 17:58:14,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14" (1/1) ... [2021-12-19 17:58:14,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14" (1/1) ... [2021-12-19 17:58:14,232 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 157 [2021-12-19 17:58:14,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 17:58:14,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 17:58:14,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 17:58:14,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 17:58:14,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14" (1/1) ... [2021-12-19 17:58:14,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14" (1/1) ... [2021-12-19 17:58:14,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14" (1/1) ... [2021-12-19 17:58:14,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14" (1/1) ... [2021-12-19 17:58:14,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14" (1/1) ... [2021-12-19 17:58:14,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14" (1/1) ... [2021-12-19 17:58:14,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14" (1/1) ... [2021-12-19 17:58:14,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 17:58:14,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 17:58:14,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 17:58:14,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 17:58:14,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14" (1/1) ... [2021-12-19 17:58:14,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:58:14,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:58:14,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:58:14,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-19 17:58:14,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 17:58:14,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 17:58:14,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 17:58:14,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-19 17:58:14,399 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 17:58:14,400 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 17:58:14,507 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 17:58:14,511 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 17:58:14,512 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-19 17:58:14,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:58:14 BoogieIcfgContainer [2021-12-19 17:58:14,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 17:58:14,514 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 17:58:14,514 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 17:58:14,529 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 17:58:14,530 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:58:14,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 05:58:13" (1/3) ... [2021-12-19 17:58:14,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d8ca8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:58:14, skipping insertion in model container [2021-12-19 17:58:14,531 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:58:14,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:58:14" (2/3) ... [2021-12-19 17:58:14,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d8ca8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:58:14, skipping insertion in model container [2021-12-19 17:58:14,531 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:58:14,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:58:14" (3/3) ... [2021-12-19 17:58:14,533 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2021-12-19 17:58:14,560 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 17:58:14,560 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 17:58:14,560 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 17:58:14,560 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 17:58:14,560 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 17:58:14,561 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 17:58:14,561 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 17:58:14,561 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 17:58:14,571 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) [2021-12-19 17:58:14,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-12-19 17:58:14,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:14,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:14,589 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:14,589 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:14,589 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 17:58:14,590 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) [2021-12-19 17:58:14,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-12-19 17:58:14,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:14,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:14,594 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:14,594 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:14,599 INFO L791 eck$LassoCheckResult]: Stem: 23#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); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#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; 14#L197-1true [2021-12-19 17:58:14,600 INFO L793 eck$LassoCheckResult]: Loop: 14#L197-1true assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 44#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; 29#L83true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 16#L83-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 10#L87-1true assume !(0 != main_~p3~0#1); 4#L91-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 46#L95-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 17#L99-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L103-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 26#L107-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 15#L111-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 33#L115-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 35#L119-1true assume !(0 != main_~p11~0#1); 47#L123-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 27#L127-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 36#L131-1true assume !(0 != main_~p1~0#1); 13#L137-1true assume !(0 != main_~p2~0#1); 8#L142-1true assume !(0 != main_~p3~0#1); 37#L147-1true assume !(0 != main_~p4~0#1); 12#L152-1true assume !(0 != main_~p5~0#1); 21#L157-1true assume !(0 != main_~p6~0#1); 18#L162-1true assume !(0 != main_~p7~0#1); 19#L167-1true assume !(0 != main_~p8~0#1); 24#L172-1true assume !(0 != main_~p9~0#1); 32#L177-1true assume !(0 != main_~p10~0#1); 48#L182-1true assume !(0 != main_~p11~0#1); 45#L187-1true assume !(0 != main_~p12~0#1); 39#L192-1true assume !(0 != main_~p13~0#1); 14#L197-1true [2021-12-19 17:58:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-19 17:58:14,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:14,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238981909] [2021-12-19 17:58:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:14,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:14,669 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:14,691 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2021-12-19 17:58:14,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:14,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991559961] [2021-12-19 17:58:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:14,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:58:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:58:14,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:58:14,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991559961] [2021-12-19 17:58:14,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991559961] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:58:14,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:58:14,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:58:14,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279329591] [2021-12-19 17:58:14,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:58:14,785 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:58:14,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:58:14,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:58:14,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:58:14,809 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) [2021-12-19 17:58:14,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:58:14,833 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2021-12-19 17:58:14,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:58:14,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 166 transitions. [2021-12-19 17:58:14,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-12-19 17:58:14,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 83 states and 133 transitions. [2021-12-19 17:58:14,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2021-12-19 17:58:14,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2021-12-19 17:58:14,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2021-12-19 17:58:14,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:58:14,846 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-12-19 17:58:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2021-12-19 17:58:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-12-19 17:58:14,866 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) [2021-12-19 17:58:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2021-12-19 17:58:14,875 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-12-19 17:58:14,875 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-12-19 17:58:14,875 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 17:58:14,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2021-12-19 17:58:14,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-12-19 17:58:14,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:14,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:14,878 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:14,878 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:14,879 INFO L791 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 [2021-12-19 17:58:14,879 INFO L793 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 [2021-12-19 17:58:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:14,880 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-19 17:58:14,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:14,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986721198] [2021-12-19 17:58:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:14,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:14,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:14,893 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2021-12-19 17:58:14,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:14,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008016893] [2021-12-19 17:58:14,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:14,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:58:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:58:14,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:58:14,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008016893] [2021-12-19 17:58:14,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008016893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:58:14,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:58:14,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:58:14,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357887333] [2021-12-19 17:58:14,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:58:14,947 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:58:14,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:58:14,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:58:14,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:58:14,950 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) [2021-12-19 17:58:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:58:14,980 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2021-12-19 17:58:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:58:14,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2021-12-19 17:58:14,983 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2021-12-19 17:58:14,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2021-12-19 17:58:14,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2021-12-19 17:58:14,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2021-12-19 17:58:14,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2021-12-19 17:58:14,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:58:14,990 INFO L681 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-12-19 17:58:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2021-12-19 17:58:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-12-19 17:58:15,002 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) [2021-12-19 17:58:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2021-12-19 17:58:15,007 INFO L704 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-12-19 17:58:15,007 INFO L587 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-12-19 17:58:15,007 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 17:58:15,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2021-12-19 17:58:15,013 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2021-12-19 17:58:15,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:15,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:15,014 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:15,014 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:15,014 INFO L791 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 [2021-12-19 17:58:15,016 INFO L793 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 [2021-12-19 17:58:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,017 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-19 17:58:15,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467853305] [2021-12-19 17:58:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,027 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,035 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,036 INFO L85 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2021-12-19 17:58:15,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165620850] [2021-12-19 17:58:15,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:58:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:58:15,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:58:15,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165620850] [2021-12-19 17:58:15,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165620850] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:58:15,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:58:15,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:58:15,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875258876] [2021-12-19 17:58:15,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:58:15,064 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:58:15,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:58:15,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:58:15,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:58:15,064 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) [2021-12-19 17:58:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:58:15,077 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2021-12-19 17:58:15,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:58:15,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2021-12-19 17:58:15,080 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2021-12-19 17:58:15,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2021-12-19 17:58:15,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2021-12-19 17:58:15,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2021-12-19 17:58:15,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2021-12-19 17:58:15,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:58:15,084 INFO L681 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-12-19 17:58:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2021-12-19 17:58:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2021-12-19 17:58:15,093 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) [2021-12-19 17:58:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2021-12-19 17:58:15,094 INFO L704 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-12-19 17:58:15,094 INFO L587 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-12-19 17:58:15,094 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 17:58:15,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2021-12-19 17:58:15,095 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2021-12-19 17:58:15,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:15,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:15,096 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:15,096 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:15,096 INFO L791 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 [2021-12-19 17:58:15,096 INFO L793 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 [2021-12-19 17:58:15,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,097 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-19 17:58:15,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8741965] [2021-12-19 17:58:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,106 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:15,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2021-12-19 17:58:15,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063644895] [2021-12-19 17:58:15,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:58:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:58:15,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:58:15,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063644895] [2021-12-19 17:58:15,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063644895] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:58:15,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:58:15,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:58:15,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333484583] [2021-12-19 17:58:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:58:15,130 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:58:15,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:58:15,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:58:15,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:58:15,131 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) [2021-12-19 17:58:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:58:15,146 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2021-12-19 17:58:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:58:15,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2021-12-19 17:58:15,150 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2021-12-19 17:58:15,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2021-12-19 17:58:15,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2021-12-19 17:58:15,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2021-12-19 17:58:15,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2021-12-19 17:58:15,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:58:15,157 INFO L681 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-12-19 17:58:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2021-12-19 17:58:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2021-12-19 17:58:15,168 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) [2021-12-19 17:58:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2021-12-19 17:58:15,169 INFO L704 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-12-19 17:58:15,169 INFO L587 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-12-19 17:58:15,170 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 17:58:15,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2021-12-19 17:58:15,198 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2021-12-19 17:58:15,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:15,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:15,198 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:15,199 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:15,199 INFO L791 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 [2021-12-19 17:58:15,199 INFO L793 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 [2021-12-19 17:58:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,199 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-19 17:58:15,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676117141] [2021-12-19 17:58:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,203 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,207 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:15,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2021-12-19 17:58:15,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343662989] [2021-12-19 17:58:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:58:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:58:15,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:58:15,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343662989] [2021-12-19 17:58:15,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343662989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:58:15,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:58:15,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:58:15,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138192622] [2021-12-19 17:58:15,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:58:15,235 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:58:15,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:58:15,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:58:15,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:58:15,236 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) [2021-12-19 17:58:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:58:15,259 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2021-12-19 17:58:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:58:15,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2021-12-19 17:58:15,269 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2021-12-19 17:58:15,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2021-12-19 17:58:15,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2021-12-19 17:58:15,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2021-12-19 17:58:15,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2021-12-19 17:58:15,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:58:15,278 INFO L681 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-12-19 17:58:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2021-12-19 17:58:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2021-12-19 17:58:15,292 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) [2021-12-19 17:58:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2021-12-19 17:58:15,294 INFO L704 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-12-19 17:58:15,295 INFO L587 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-12-19 17:58:15,295 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 17:58:15,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2021-12-19 17:58:15,299 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2021-12-19 17:58:15,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:15,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:15,301 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:15,301 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:15,301 INFO L791 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 [2021-12-19 17:58:15,302 INFO L793 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 [2021-12-19 17:58:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-19 17:58:15,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056957755] [2021-12-19 17:58:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,306 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,310 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:15,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,310 INFO L85 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2021-12-19 17:58:15,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194954443] [2021-12-19 17:58:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:58:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:58:15,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:58:15,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194954443] [2021-12-19 17:58:15,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194954443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:58:15,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:58:15,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:58:15,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184435050] [2021-12-19 17:58:15,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:58:15,341 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:58:15,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:58:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:58:15,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:58:15,343 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) [2021-12-19 17:58:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:58:15,365 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2021-12-19 17:58:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:58:15,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2021-12-19 17:58:15,384 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2021-12-19 17:58:15,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2021-12-19 17:58:15,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2021-12-19 17:58:15,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2021-12-19 17:58:15,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2021-12-19 17:58:15,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:58:15,397 INFO L681 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-12-19 17:58:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2021-12-19 17:58:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2021-12-19 17:58:15,425 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) [2021-12-19 17:58:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2021-12-19 17:58:15,430 INFO L704 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-12-19 17:58:15,430 INFO L587 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-12-19 17:58:15,432 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 17:58:15,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2021-12-19 17:58:15,441 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2021-12-19 17:58:15,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:15,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:15,443 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:15,443 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:15,443 INFO L791 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 [2021-12-19 17:58:15,444 INFO L793 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 [2021-12-19 17:58:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,445 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-19 17:58:15,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669262925] [2021-12-19 17:58:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,450 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,458 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:15,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2021-12-19 17:58:15,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215732869] [2021-12-19 17:58:15,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:58:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:58:15,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:58:15,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215732869] [2021-12-19 17:58:15,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215732869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:58:15,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:58:15,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:58:15,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666461608] [2021-12-19 17:58:15,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:58:15,501 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:58:15,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:58:15,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:58:15,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:58:15,502 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) [2021-12-19 17:58:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:58:15,540 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2021-12-19 17:58:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:58:15,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2021-12-19 17:58:15,565 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2021-12-19 17:58:15,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2021-12-19 17:58:15,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2021-12-19 17:58:15,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2021-12-19 17:58:15,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2021-12-19 17:58:15,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:58:15,590 INFO L681 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-12-19 17:58:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2021-12-19 17:58:15,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2021-12-19 17:58:15,647 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) [2021-12-19 17:58:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2021-12-19 17:58:15,656 INFO L704 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-12-19 17:58:15,656 INFO L587 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-12-19 17:58:15,656 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-19 17:58:15,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2021-12-19 17:58:15,672 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2021-12-19 17:58:15,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:15,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:15,675 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:15,675 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:15,675 INFO L791 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 [2021-12-19 17:58:15,676 INFO L793 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 [2021-12-19 17:58:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-19 17:58:15,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688135923] [2021-12-19 17:58:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,683 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:15,686 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:15,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2021-12-19 17:58:15,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:15,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078974343] [2021-12-19 17:58:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:15,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:58:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:58:15,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:58:15,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078974343] [2021-12-19 17:58:15,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078974343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:58:15,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:58:15,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:58:15,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234912921] [2021-12-19 17:58:15,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:58:15,723 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:58:15,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:58:15,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:58:15,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:58:15,724 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) [2021-12-19 17:58:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:58:15,771 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2021-12-19 17:58:15,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:58:15,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2021-12-19 17:58:15,814 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2021-12-19 17:58:15,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2021-12-19 17:58:15,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2021-12-19 17:58:15,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2021-12-19 17:58:15,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2021-12-19 17:58:15,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:58:15,873 INFO L681 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-12-19 17:58:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2021-12-19 17:58:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2021-12-19 17:58:16,019 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) [2021-12-19 17:58:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2021-12-19 17:58:16,037 INFO L704 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-12-19 17:58:16,037 INFO L587 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-12-19 17:58:16,037 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-19 17:58:16,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2021-12-19 17:58:16,065 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2021-12-19 17:58:16,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:16,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:16,066 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:16,066 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:16,066 INFO L791 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 [2021-12-19 17:58:16,067 INFO L793 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 [2021-12-19 17:58:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:16,068 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-12-19 17:58:16,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:16,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498574123] [2021-12-19 17:58:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:16,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:16,077 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:16,082 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:16,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2021-12-19 17:58:16,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:16,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293098166] [2021-12-19 17:58:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:16,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:58:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:58:16,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:58:16,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293098166] [2021-12-19 17:58:16,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293098166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:58:16,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:58:16,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:58:16,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680445869] [2021-12-19 17:58:16,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:58:16,115 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:58:16,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:58:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:58:16,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:58:16,116 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) [2021-12-19 17:58:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:58:16,212 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2021-12-19 17:58:16,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:58:16,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2021-12-19 17:58:16,284 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2021-12-19 17:58:16,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2021-12-19 17:58:16,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2021-12-19 17:58:16,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2021-12-19 17:58:16,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2021-12-19 17:58:16,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:58:16,419 INFO L681 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-12-19 17:58:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2021-12-19 17:58:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2021-12-19 17:58:16,651 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) [2021-12-19 17:58:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2021-12-19 17:58:16,702 INFO L704 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-12-19 17:58:16,702 INFO L587 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-12-19 17:58:16,702 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-19 17:58:16,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2021-12-19 17:58:16,771 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2021-12-19 17:58:16,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:16,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:16,772 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:16,773 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:16,773 INFO L791 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 [2021-12-19 17:58:16,773 INFO L793 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 [2021-12-19 17:58:16,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:16,774 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-12-19 17:58:16,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:16,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325204358] [2021-12-19 17:58:16,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:16,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:16,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:16,783 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:16,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2021-12-19 17:58:16,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:16,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124214478] [2021-12-19 17:58:16,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:16,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:58:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:58:16,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:58:16,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124214478] [2021-12-19 17:58:16,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124214478] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:58:16,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:58:16,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:58:16,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773341766] [2021-12-19 17:58:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:58:16,806 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:58:16,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:58:16,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:58:16,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:58:16,808 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) [2021-12-19 17:58:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:58:16,966 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2021-12-19 17:58:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:58:16,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2021-12-19 17:58:17,185 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2021-12-19 17:58:17,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2021-12-19 17:58:17,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2021-12-19 17:58:17,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2021-12-19 17:58:17,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2021-12-19 17:58:17,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:58:17,376 INFO L681 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-12-19 17:58:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2021-12-19 17:58:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2021-12-19 17:58:17,955 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) [2021-12-19 17:58:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2021-12-19 17:58:18,130 INFO L704 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-12-19 17:58:18,130 INFO L587 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-12-19 17:58:18,130 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-19 17:58:18,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2021-12-19 17:58:18,214 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2021-12-19 17:58:18,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:18,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:18,215 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:18,215 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:18,215 INFO L791 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 [2021-12-19 17:58:18,215 INFO L793 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 [2021-12-19 17:58:18,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-12-19 17:58:18,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:18,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416928595] [2021-12-19 17:58:18,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:18,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:18,219 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:18,222 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:18,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash 463639801, now seen corresponding path program 1 times [2021-12-19 17:58:18,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:18,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844143519] [2021-12-19 17:58:18,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:18,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:58:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:58:18,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:58:18,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844143519] [2021-12-19 17:58:18,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844143519] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:58:18,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:58:18,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 17:58:18,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999751019] [2021-12-19 17:58:18,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:58:18,244 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:58:18,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:58:18,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:58:18,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:58:18,245 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) [2021-12-19 17:58:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:58:18,384 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2021-12-19 17:58:18,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:58:18,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2021-12-19 17:58:18,668 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2021-12-19 17:58:18,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2021-12-19 17:58:18,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2021-12-19 17:58:18,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2021-12-19 17:58:18,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2021-12-19 17:58:18,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:58:19,000 INFO L681 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-12-19 17:58:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2021-12-19 17:58:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2021-12-19 17:58:20,116 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) [2021-12-19 17:58:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2021-12-19 17:58:20,302 INFO L704 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-12-19 17:58:20,302 INFO L587 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-12-19 17:58:20,302 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-19 17:58:20,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2021-12-19 17:58:20,628 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2021-12-19 17:58:20,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:58:20,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:58:20,629 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:58:20,630 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:58:20,630 INFO L791 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 [2021-12-19 17:58:20,630 INFO L793 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 [2021-12-19 17:58:20,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-12-19 17:58:20,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:20,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228519838] [2021-12-19 17:58:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:20,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:20,633 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:20,636 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash -547477449, now seen corresponding path program 1 times [2021-12-19 17:58:20,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:20,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702753334] [2021-12-19 17:58:20,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:20,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:20,639 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:20,645 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:58:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash 496424185, now seen corresponding path program 1 times [2021-12-19 17:58:20,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:58:20,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993685388] [2021-12-19 17:58:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:58:20,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:58:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:20,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:58:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:58:20,654 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:58:20,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.12 05:58:20 BoogieIcfgContainer [2021-12-19 17:58:20,912 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-19 17:58:20,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-19 17:58:20,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-19 17:58:20,913 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-19 17:58:20,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:58:14" (3/4) ... [2021-12-19 17:58:20,915 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-19 17:58:20,942 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-19 17:58:20,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-19 17:58:20,943 INFO L158 Benchmark]: Toolchain (without parser) took 7008.88ms. Allocated memory was 100.7MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 69.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 554.3MB. Max. memory is 16.1GB. [2021-12-19 17:58:20,943 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 100.7MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 17:58:20,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.96ms. Allocated memory is still 100.7MB. Free memory was 68.8MB in the beginning and 76.8MB in the end (delta: -8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-19 17:58:20,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.08ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 75.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 17:58:20,944 INFO L158 Benchmark]: Boogie Preprocessor took 35.15ms. Allocated memory is still 100.7MB. Free memory was 75.2MB in the beginning and 73.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 17:58:20,944 INFO L158 Benchmark]: RCFGBuilder took 244.72ms. Allocated memory is still 100.7MB. Free memory was 73.6MB in the beginning and 61.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-19 17:58:20,944 INFO L158 Benchmark]: BuchiAutomizer took 6398.36ms. Allocated memory was 100.7MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 61.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 546.6MB. Max. memory is 16.1GB. [2021-12-19 17:58:20,944 INFO L158 Benchmark]: Witness Printer took 29.60ms. Allocated memory is still 2.6GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 17:58:20,946 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.35ms. Allocated memory is still 100.7MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.96ms. Allocated memory is still 100.7MB. Free memory was 68.8MB in the beginning and 76.8MB in the end (delta: -8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.08ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 75.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.15ms. Allocated memory is still 100.7MB. Free memory was 75.2MB in the beginning and 73.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 244.72ms. Allocated memory is still 100.7MB. Free memory was 73.6MB in the beginning and 61.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6398.36ms. Allocated memory was 100.7MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 61.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 546.6MB. Max. memory is 16.1GB. * Witness Printer took 29.60ms. Allocated memory is still 2.6GB. Free memory was 2.1GB in the beginning and 2.1GB 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.3s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.1s Buchi closure took 0.0s. Biggest automaton had 72706 states and ocurred in iteration 11. 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 - 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@4ee238db=0, lk11=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a75cdf0=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fd919dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2992c3cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a39c252=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@770a9041=0, \result=0, lk10=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11802858=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e7bee53=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a5c76ba=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e3302f1=0, p2=0, lk4=0, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@615b2a99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70434997=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@471bb880=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71891e18=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! [2021-12-19 17:58:20,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)