./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_15-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 09:15:19,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 09:15:19,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 09:15:19,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 09:15:19,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 09:15:19,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 09:15:19,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 09:15:19,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 09:15:19,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 09:15:19,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 09:15:19,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 09:15:19,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 09:15:19,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 09:15:19,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 09:15:19,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 09:15:19,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 09:15:19,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 09:15:19,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 09:15:19,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 09:15:19,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 09:15:19,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 09:15:19,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 09:15:19,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 09:15:19,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 09:15:19,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 09:15:19,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 09:15:19,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 09:15:19,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 09:15:19,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 09:15:19,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 09:15:19,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 09:15:19,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 09:15:19,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 09:15:19,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 09:15:19,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 09:15:19,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 09:15:19,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 09:15:19,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 09:15:19,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 09:15:19,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 09:15:19,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 09:15:19,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-28 09:15:19,178 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 09:15:19,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 09:15:19,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 09:15:19,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 09:15:19,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 09:15:19,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 09:15:19,181 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 09:15:19,181 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-28 09:15:19,181 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-28 09:15:19,181 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-28 09:15:19,182 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-28 09:15:19,182 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-28 09:15:19,182 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-28 09:15:19,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 09:15:19,183 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 09:15:19,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 09:15:19,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 09:15:19,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 09:15:19,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 09:15:19,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-28 09:15:19,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-28 09:15:19,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-28 09:15:19,184 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 09:15:19,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 09:15:19,184 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-28 09:15:19,184 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 09:15:19,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-28 09:15:19,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 09:15:19,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 09:15:19,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 09:15:19,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 09:15:19,186 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-28 09:15:19,186 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2021-12-28 09:15:19,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 09:15:19,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 09:15:19,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 09:15:19,468 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 09:15:19,469 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 09:15:19,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2021-12-28 09:15:19,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a93cb12/bfb0db0766a346af8edf9e89de69c923/FLAG33de04f72 [2021-12-28 09:15:19,903 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 09:15:19,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2021-12-28 09:15:19,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a93cb12/bfb0db0766a346af8edf9e89de69c923/FLAG33de04f72 [2021-12-28 09:15:19,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a93cb12/bfb0db0766a346af8edf9e89de69c923 [2021-12-28 09:15:19,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 09:15:19,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 09:15:19,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 09:15:19,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 09:15:19,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 09:15:19,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:15:19" (1/1) ... [2021-12-28 09:15:19,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a708c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:19, skipping insertion in model container [2021-12-28 09:15:19,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:15:19" (1/1) ... [2021-12-28 09:15:19,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 09:15:19,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 09:15:20,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c[5654,5667] [2021-12-28 09:15:20,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:15:20,060 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 09:15:20,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c[5654,5667] [2021-12-28 09:15:20,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:15:20,125 INFO L208 MainTranslator]: Completed translation [2021-12-28 09:15:20,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20 WrapperNode [2021-12-28 09:15:20,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 09:15:20,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 09:15:20,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 09:15:20,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 09:15:20,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20" (1/1) ... [2021-12-28 09:15:20,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20" (1/1) ... [2021-12-28 09:15:20,151 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2021-12-28 09:15:20,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 09:15:20,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 09:15:20,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 09:15:20,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 09:15:20,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20" (1/1) ... [2021-12-28 09:15:20,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20" (1/1) ... [2021-12-28 09:15:20,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20" (1/1) ... [2021-12-28 09:15:20,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20" (1/1) ... [2021-12-28 09:15:20,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20" (1/1) ... [2021-12-28 09:15:20,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20" (1/1) ... [2021-12-28 09:15:20,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20" (1/1) ... [2021-12-28 09:15:20,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 09:15:20,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 09:15:20,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 09:15:20,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 09:15:20,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20" (1/1) ... [2021-12-28 09:15:20,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:15:20,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:15:20,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:15:20,218 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-28 09:15:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 09:15:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 09:15:20,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 09:15:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 09:15:20,277 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 09:15:20,278 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 09:15:20,452 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 09:15:20,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 09:15:20,472 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-28 09:15:20,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:15:20 BoogieIcfgContainer [2021-12-28 09:15:20,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 09:15:20,474 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-28 09:15:20,474 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-28 09:15:20,476 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-28 09:15:20,477 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:15:20,477 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.12 09:15:19" (1/3) ... [2021-12-28 09:15:20,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b5db63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:15:20, skipping insertion in model container [2021-12-28 09:15:20,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:15:20,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:15:20" (2/3) ... [2021-12-28 09:15:20,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b5db63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:15:20, skipping insertion in model container [2021-12-28 09:15:20,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:15:20,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:15:20" (3/3) ... [2021-12-28 09:15:20,479 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2021-12-28 09:15:20,546 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-28 09:15:20,546 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-28 09:15:20,546 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-28 09:15:20,547 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-28 09:15:20,547 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-28 09:15:20,547 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-28 09:15:20,547 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-28 09:15:20,547 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-28 09:15:20,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:15:20,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-12-28 09:15:20,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:20,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:20,586 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:20,586 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:20,586 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-28 09:15:20,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:15:20,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-12-28 09:15:20,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:20,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:20,595 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:20,595 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:20,601 INFO L791 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 22#L225-1true [2021-12-28 09:15:20,605 INFO L793 eck$LassoCheckResult]: Loop: 22#L225-1true assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33#L58true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 29#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 27#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 14#L97-1true assume !(0 != main_~p3~0#1); 17#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 50#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 45#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 13#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 24#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 31#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 18#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 36#L129-1true assume !(0 != main_~p11~0#1); 4#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 40#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 55#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 48#L149-1true assume !(0 != main_~p1~0#1); 47#L155-1true assume 0 != main_~p2~0#1; 9#L161true assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 20#L160true assume !(0 != main_~p3~0#1); 12#L165-1true assume !(0 != main_~p4~0#1); 42#L170-1true assume !(0 != main_~p5~0#1); 46#L175-1true assume !(0 != main_~p6~0#1); 19#L180-1true assume !(0 != main_~p7~0#1); 39#L185-1true assume !(0 != main_~p8~0#1); 26#L190-1true assume !(0 != main_~p9~0#1); 41#L195-1true assume !(0 != main_~p10~0#1); 16#L200-1true assume !(0 != main_~p11~0#1); 44#L205-1true assume !(0 != main_~p12~0#1); 25#L210-1true assume !(0 != main_~p13~0#1); 6#L215-1true assume 0 != main_~p14~0#1; 15#L221true assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 54#L220true assume !(0 != main_~p15~0#1); 22#L225-1true [2021-12-28 09:15:20,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:20,614 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-28 09:15:20,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:20,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206940716] [2021-12-28 09:15:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:20,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:20,685 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:20,726 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash -638858682, now seen corresponding path program 1 times [2021-12-28 09:15:20,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:20,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893666043] [2021-12-28 09:15:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:20,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:15:20,865 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-28 09:15:20,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:15:20,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893666043] [2021-12-28 09:15:20,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893666043] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:15:20,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:15:20,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 09:15:20,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103434619] [2021-12-28 09:15:20,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:15:20,870 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:15:20,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:15:20,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:15:20,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:15:20,902 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-28 09:15:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:15:20,946 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2021-12-28 09:15:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:15:20,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2021-12-28 09:15:20,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-12-28 09:15:20,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 149 transitions. [2021-12-28 09:15:20,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2021-12-28 09:15:20,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2021-12-28 09:15:20,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 149 transitions. [2021-12-28 09:15:20,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:15:20,970 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-12-28 09:15:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 149 transitions. [2021-12-28 09:15:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-28 09:15:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 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-28 09:15:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2021-12-28 09:15:21,003 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-12-28 09:15:21,003 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-12-28 09:15:21,003 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-28 09:15:21,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 149 transitions. [2021-12-28 09:15:21,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-12-28 09:15:21,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:21,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:21,009 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:21,009 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:21,009 INFO L791 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 212#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 174#L225-1 [2021-12-28 09:15:21,010 INFO L793 eck$LassoCheckResult]: Loop: 174#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 210#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 211#L93 assume !(0 != main_~p1~0#1); 206#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 186#L97-1 assume !(0 != main_~p3~0#1); 187#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 191#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 220#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 182#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 183#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 201#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 192#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 193#L129-1 assume !(0 != main_~p11~0#1); 168#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 169#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 172#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 215#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 226#L149-1 assume !(0 != main_~p1~0#1); 227#L155-1 assume 0 != main_~p2~0#1; 262#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 261#L160 assume !(0 != main_~p3~0#1); 259#L165-1 assume !(0 != main_~p4~0#1); 256#L170-1 assume !(0 != main_~p5~0#1); 255#L175-1 assume !(0 != main_~p6~0#1); 253#L180-1 assume !(0 != main_~p7~0#1); 250#L185-1 assume !(0 != main_~p8~0#1); 249#L190-1 assume !(0 != main_~p9~0#1); 216#L195-1 assume !(0 != main_~p10~0#1); 188#L200-1 assume !(0 != main_~p11~0#1); 189#L205-1 assume !(0 != main_~p12~0#1); 241#L210-1 assume !(0 != main_~p13~0#1); 239#L215-1 assume 0 != main_~p14~0#1; 184#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 185#L220 assume !(0 != main_~p15~0#1); 174#L225-1 [2021-12-28 09:15:21,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,011 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-28 09:15:21,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295920393] [2021-12-28 09:15:21,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,038 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:21,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,039 INFO L85 PathProgramCache]: Analyzing trace with hash -364099068, now seen corresponding path program 1 times [2021-12-28 09:15:21,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834651732] [2021-12-28 09:15:21,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:15:21,109 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-28 09:15:21,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:15:21,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834651732] [2021-12-28 09:15:21,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834651732] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:15:21,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:15:21,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 09:15:21,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269951065] [2021-12-28 09:15:21,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:15:21,112 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:15:21,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:15:21,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:15:21,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:15:21,115 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-28 09:15:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:15:21,134 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2021-12-28 09:15:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:15:21,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 290 transitions. [2021-12-28 09:15:21,138 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-12-28 09:15:21,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 290 transitions. [2021-12-28 09:15:21,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2021-12-28 09:15:21,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2021-12-28 09:15:21,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 290 transitions. [2021-12-28 09:15:21,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:15:21,144 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-12-28 09:15:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 290 transitions. [2021-12-28 09:15:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-12-28 09:15:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 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-28 09:15:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2021-12-28 09:15:21,154 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-12-28 09:15:21,154 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-12-28 09:15:21,154 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-28 09:15:21,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 290 transitions. [2021-12-28 09:15:21,155 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-12-28 09:15:21,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:21,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:21,157 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:21,157 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:21,157 INFO L791 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 495#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 496#L225-1 [2021-12-28 09:15:21,158 INFO L793 eck$LassoCheckResult]: Loop: 496#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 521#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 518#L93 assume !(0 != main_~p1~0#1); 519#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 513#L97-1 assume !(0 != main_~p3~0#1); 514#L101-1 assume !(0 != main_~p4~0#1); 589#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 588#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 587#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 586#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 585#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 584#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 583#L129-1 assume !(0 != main_~p11~0#1); 582#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 581#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 580#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 579#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 578#L149-1 assume !(0 != main_~p1~0#1); 577#L155-1 assume 0 != main_~p2~0#1; 576#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 573#L160 assume !(0 != main_~p3~0#1); 569#L165-1 assume !(0 != main_~p4~0#1); 565#L170-1 assume !(0 != main_~p5~0#1); 562#L175-1 assume !(0 != main_~p6~0#1); 558#L180-1 assume !(0 != main_~p7~0#1); 553#L185-1 assume !(0 != main_~p8~0#1); 550#L190-1 assume !(0 != main_~p9~0#1); 546#L195-1 assume !(0 != main_~p10~0#1); 542#L200-1 assume !(0 != main_~p11~0#1); 538#L205-1 assume !(0 != main_~p12~0#1); 534#L210-1 assume !(0 != main_~p13~0#1); 530#L215-1 assume 0 != main_~p14~0#1; 528#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 526#L220 assume !(0 != main_~p15~0#1); 496#L225-1 [2021-12-28 09:15:21,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,159 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-28 09:15:21,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903401523] [2021-12-28 09:15:21,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,186 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:21,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1022104326, now seen corresponding path program 1 times [2021-12-28 09:15:21,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427044845] [2021-12-28 09:15:21,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:15:21,229 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-28 09:15:21,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:15:21,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427044845] [2021-12-28 09:15:21,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427044845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:15:21,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:15:21,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 09:15:21,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938642823] [2021-12-28 09:15:21,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:15:21,232 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:15:21,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:15:21,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:15:21,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:15:21,233 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-28 09:15:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:15:21,250 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2021-12-28 09:15:21,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:15:21,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 566 transitions. [2021-12-28 09:15:21,254 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-12-28 09:15:21,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 566 transitions. [2021-12-28 09:15:21,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2021-12-28 09:15:21,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2021-12-28 09:15:21,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 566 transitions. [2021-12-28 09:15:21,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:15:21,260 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-12-28 09:15:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 566 transitions. [2021-12-28 09:15:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-12-28 09:15:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 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-28 09:15:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 566 transitions. [2021-12-28 09:15:21,272 INFO L704 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-12-28 09:15:21,272 INFO L587 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-12-28 09:15:21,272 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-28 09:15:21,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 566 transitions. [2021-12-28 09:15:21,273 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-12-28 09:15:21,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:21,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:21,274 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:21,274 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:21,274 INFO L791 eck$LassoCheckResult]: Stem: 1060#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1053#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1054#L225-1 [2021-12-28 09:15:21,275 INFO L793 eck$LassoCheckResult]: Loop: 1054#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1078#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1079#L93 assume !(0 != main_~p1~0#1); 1205#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 1223#L97-1 assume !(0 != main_~p3~0#1); 1220#L101-1 assume !(0 != main_~p4~0#1); 1217#L105-1 assume !(0 != main_~p5~0#1); 1215#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1214#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1212#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1210#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1208#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1206#L129-1 assume !(0 != main_~p11~0#1); 1203#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1200#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1197#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1193#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1167#L149-1 assume !(0 != main_~p1~0#1); 1165#L155-1 assume 0 != main_~p2~0#1; 1162#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 1160#L160 assume !(0 != main_~p3~0#1); 1156#L165-1 assume !(0 != main_~p4~0#1); 1153#L170-1 assume !(0 != main_~p5~0#1); 1132#L175-1 assume !(0 != main_~p6~0#1); 1128#L180-1 assume !(0 != main_~p7~0#1); 1122#L185-1 assume !(0 != main_~p8~0#1); 1118#L190-1 assume !(0 != main_~p9~0#1); 1117#L195-1 assume !(0 != main_~p10~0#1); 1241#L200-1 assume !(0 != main_~p11~0#1); 1103#L205-1 assume !(0 != main_~p12~0#1); 1102#L210-1 assume !(0 != main_~p13~0#1); 1091#L215-1 assume 0 != main_~p14~0#1; 1092#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 1086#L220 assume !(0 != main_~p15~0#1); 1054#L225-1 [2021-12-28 09:15:21,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,275 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-28 09:15:21,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724730470] [2021-12-28 09:15:21,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,283 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,284 INFO L85 PathProgramCache]: Analyzing trace with hash 512631236, now seen corresponding path program 1 times [2021-12-28 09:15:21,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292421920] [2021-12-28 09:15:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:15:21,312 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-28 09:15:21,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:15:21,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292421920] [2021-12-28 09:15:21,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292421920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:15:21,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:15:21,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 09:15:21,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735454088] [2021-12-28 09:15:21,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:15:21,313 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:15:21,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:15:21,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:15:21,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:15:21,314 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-28 09:15:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:15:21,329 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2021-12-28 09:15:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:15:21,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1106 transitions. [2021-12-28 09:15:21,334 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-12-28 09:15:21,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1106 transitions. [2021-12-28 09:15:21,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2021-12-28 09:15:21,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2021-12-28 09:15:21,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1106 transitions. [2021-12-28 09:15:21,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:15:21,338 INFO L681 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-12-28 09:15:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1106 transitions. [2021-12-28 09:15:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2021-12-28 09:15:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 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-28 09:15:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1106 transitions. [2021-12-28 09:15:21,373 INFO L704 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-12-28 09:15:21,373 INFO L587 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-12-28 09:15:21,373 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-28 09:15:21,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1106 transitions. [2021-12-28 09:15:21,375 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-12-28 09:15:21,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:21,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:21,375 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:21,375 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:21,376 INFO L791 eck$LassoCheckResult]: Stem: 2165#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 2154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2155#L225-1 [2021-12-28 09:15:21,376 INFO L793 eck$LassoCheckResult]: Loop: 2155#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2351#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 2348#L93 assume !(0 != main_~p1~0#1); 2349#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 2338#L97-1 assume !(0 != main_~p3~0#1); 2339#L101-1 assume !(0 != main_~p4~0#1); 2327#L105-1 assume !(0 != main_~p5~0#1); 2329#L109-1 assume !(0 != main_~p6~0#1); 2315#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2316#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2303#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2304#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2291#L129-1 assume !(0 != main_~p11~0#1); 2292#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2279#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2280#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2267#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2268#L149-1 assume !(0 != main_~p1~0#1); 2399#L155-1 assume 0 != main_~p2~0#1; 2398#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 2397#L160 assume !(0 != main_~p3~0#1); 2393#L165-1 assume !(0 != main_~p4~0#1); 2391#L170-1 assume !(0 != main_~p5~0#1); 2389#L175-1 assume !(0 != main_~p6~0#1); 2386#L180-1 assume !(0 != main_~p7~0#1); 2381#L185-1 assume !(0 != main_~p8~0#1); 2378#L190-1 assume !(0 != main_~p9~0#1); 2374#L195-1 assume !(0 != main_~p10~0#1); 2370#L200-1 assume !(0 != main_~p11~0#1); 2366#L205-1 assume !(0 != main_~p12~0#1); 2362#L210-1 assume !(0 != main_~p13~0#1); 2359#L215-1 assume 0 != main_~p14~0#1; 2357#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 2356#L220 assume !(0 != main_~p15~0#1); 2155#L225-1 [2021-12-28 09:15:21,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-28 09:15:21,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110422198] [2021-12-28 09:15:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,383 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:21,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1859108026, now seen corresponding path program 1 times [2021-12-28 09:15:21,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128642453] [2021-12-28 09:15:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:15:21,401 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-28 09:15:21,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:15:21,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128642453] [2021-12-28 09:15:21,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128642453] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:15:21,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:15:21,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 09:15:21,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916315582] [2021-12-28 09:15:21,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:15:21,402 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:15:21,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:15:21,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:15:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:15:21,403 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-28 09:15:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:15:21,417 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2021-12-28 09:15:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:15:21,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2162 transitions. [2021-12-28 09:15:21,426 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-12-28 09:15:21,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2162 transitions. [2021-12-28 09:15:21,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2021-12-28 09:15:21,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2021-12-28 09:15:21,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2162 transitions. [2021-12-28 09:15:21,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:15:21,434 INFO L681 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-12-28 09:15:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2162 transitions. [2021-12-28 09:15:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2021-12-28 09:15:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 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-28 09:15:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2162 transitions. [2021-12-28 09:15:21,454 INFO L704 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-12-28 09:15:21,454 INFO L587 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-12-28 09:15:21,454 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-28 09:15:21,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2162 transitions. [2021-12-28 09:15:21,459 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-12-28 09:15:21,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:21,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:21,459 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:21,459 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:21,460 INFO L791 eck$LassoCheckResult]: Stem: 4312#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 4301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4302#L225-1 [2021-12-28 09:15:21,460 INFO L793 eck$LassoCheckResult]: Loop: 4302#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4635#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 4632#L93 assume !(0 != main_~p1~0#1); 4595#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4352#L97-1 assume !(0 != main_~p3~0#1); 4353#L101-1 assume !(0 != main_~p4~0#1); 4588#L105-1 assume !(0 != main_~p5~0#1); 4586#L109-1 assume !(0 != main_~p6~0#1); 4580#L113-1 assume !(0 != main_~p7~0#1); 4576#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4572#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4569#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4566#L129-1 assume !(0 != main_~p11~0#1); 4563#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4559#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4556#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4553#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4548#L149-1 assume !(0 != main_~p1~0#1); 4546#L155-1 assume 0 != main_~p2~0#1; 4543#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 4540#L160 assume !(0 != main_~p3~0#1); 4535#L165-1 assume !(0 != main_~p4~0#1); 4536#L170-1 assume !(0 != main_~p5~0#1); 4686#L175-1 assume !(0 != main_~p6~0#1); 4682#L180-1 assume !(0 != main_~p7~0#1); 4678#L185-1 assume !(0 != main_~p8~0#1); 4674#L190-1 assume !(0 != main_~p9~0#1); 4668#L195-1 assume !(0 != main_~p10~0#1); 4663#L200-1 assume !(0 != main_~p11~0#1); 4658#L205-1 assume !(0 != main_~p12~0#1); 4653#L210-1 assume !(0 != main_~p13~0#1); 4648#L215-1 assume 0 != main_~p14~0#1; 4645#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 4642#L220 assume !(0 != main_~p15~0#1); 4302#L225-1 [2021-12-28 09:15:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-28 09:15:21,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164178572] [2021-12-28 09:15:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,472 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:21,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1797068412, now seen corresponding path program 1 times [2021-12-28 09:15:21,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773363365] [2021-12-28 09:15:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:15:21,493 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-28 09:15:21,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:15:21,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773363365] [2021-12-28 09:15:21,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773363365] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:15:21,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:15:21,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 09:15:21,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806770531] [2021-12-28 09:15:21,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:15:21,501 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:15:21,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:15:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:15:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:15:21,502 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-28 09:15:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:15:21,519 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2021-12-28 09:15:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:15:21,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4226 transitions. [2021-12-28 09:15:21,539 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-12-28 09:15:21,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4226 transitions. [2021-12-28 09:15:21,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2021-12-28 09:15:21,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2021-12-28 09:15:21,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4226 transitions. [2021-12-28 09:15:21,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:15:21,554 INFO L681 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-12-28 09:15:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4226 transitions. [2021-12-28 09:15:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2021-12-28 09:15:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 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-28 09:15:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4226 transitions. [2021-12-28 09:15:21,604 INFO L704 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-12-28 09:15:21,604 INFO L587 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-12-28 09:15:21,606 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-28 09:15:21,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4226 transitions. [2021-12-28 09:15:21,624 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-12-28 09:15:21,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:21,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:21,627 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:21,627 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:21,627 INFO L791 eck$LassoCheckResult]: Stem: 8565#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 8557#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8558#L225-1 [2021-12-28 09:15:21,627 INFO L793 eck$LassoCheckResult]: Loop: 8558#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8705#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 8706#L93 assume !(0 != main_~p1~0#1); 8830#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 8829#L97-1 assume !(0 != main_~p3~0#1); 8827#L101-1 assume !(0 != main_~p4~0#1); 8824#L105-1 assume !(0 != main_~p5~0#1); 8820#L109-1 assume !(0 != main_~p6~0#1); 8816#L113-1 assume !(0 != main_~p7~0#1); 8812#L117-1 assume !(0 != main_~p8~0#1); 8810#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8808#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8806#L129-1 assume !(0 != main_~p11~0#1); 8804#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8802#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8800#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8798#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8795#L149-1 assume !(0 != main_~p1~0#1); 8796#L155-1 assume 0 != main_~p2~0#1; 8785#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 8786#L160 assume !(0 != main_~p3~0#1); 8777#L165-1 assume !(0 != main_~p4~0#1); 8778#L170-1 assume !(0 != main_~p5~0#1); 8766#L175-1 assume !(0 != main_~p6~0#1); 8768#L180-1 assume !(0 != main_~p7~0#1); 8756#L185-1 assume !(0 != main_~p8~0#1); 8757#L190-1 assume !(0 != main_~p9~0#1); 8747#L195-1 assume !(0 != main_~p10~0#1); 8746#L200-1 assume !(0 != main_~p11~0#1); 8735#L205-1 assume !(0 != main_~p12~0#1); 8734#L210-1 assume !(0 != main_~p13~0#1); 8722#L215-1 assume 0 != main_~p14~0#1; 8723#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 8715#L220 assume !(0 != main_~p15~0#1); 8558#L225-1 [2021-12-28 09:15:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-28 09:15:21,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230287889] [2021-12-28 09:15:21,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,643 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:21,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1656519802, now seen corresponding path program 1 times [2021-12-28 09:15:21,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474216788] [2021-12-28 09:15:21,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:15:21,670 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-28 09:15:21,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:15:21,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474216788] [2021-12-28 09:15:21,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474216788] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:15:21,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:15:21,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 09:15:21,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187631522] [2021-12-28 09:15:21,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:15:21,672 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:15:21,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:15:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:15:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:15:21,673 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-28 09:15:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:15:21,698 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2021-12-28 09:15:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:15:21,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8258 transitions. [2021-12-28 09:15:21,747 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-12-28 09:15:21,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8258 transitions. [2021-12-28 09:15:21,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2021-12-28 09:15:21,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2021-12-28 09:15:21,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8258 transitions. [2021-12-28 09:15:21,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:15:21,788 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-12-28 09:15:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8258 transitions. [2021-12-28 09:15:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2021-12-28 09:15:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 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-28 09:15:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8258 transitions. [2021-12-28 09:15:21,907 INFO L704 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-12-28 09:15:21,907 INFO L587 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-12-28 09:15:21,907 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-28 09:15:21,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8258 transitions. [2021-12-28 09:15:21,926 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-12-28 09:15:21,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:21,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:21,927 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:21,927 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:21,927 INFO L791 eck$LassoCheckResult]: Stem: 16967#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 16953#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16954#L225-1 [2021-12-28 09:15:21,929 INFO L793 eck$LassoCheckResult]: Loop: 16954#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17157#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 17155#L93 assume !(0 != main_~p1~0#1); 17151#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 17147#L97-1 assume !(0 != main_~p3~0#1); 17140#L101-1 assume !(0 != main_~p4~0#1); 17132#L105-1 assume !(0 != main_~p5~0#1); 17127#L109-1 assume !(0 != main_~p6~0#1); 17120#L113-1 assume !(0 != main_~p7~0#1); 17112#L117-1 assume !(0 != main_~p8~0#1); 17104#L121-1 assume !(0 != main_~p9~0#1); 17099#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17095#L129-1 assume !(0 != main_~p11~0#1); 17091#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17087#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17083#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17079#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17073#L149-1 assume !(0 != main_~p1~0#1); 17074#L155-1 assume 0 != main_~p2~0#1; 17211#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 17206#L160 assume !(0 != main_~p3~0#1); 17201#L165-1 assume !(0 != main_~p4~0#1); 17197#L170-1 assume !(0 != main_~p5~0#1); 17193#L175-1 assume !(0 != main_~p6~0#1); 17191#L180-1 assume !(0 != main_~p7~0#1); 17189#L185-1 assume !(0 != main_~p8~0#1); 17185#L190-1 assume !(0 != main_~p9~0#1); 17182#L195-1 assume !(0 != main_~p10~0#1); 17178#L200-1 assume !(0 != main_~p11~0#1); 17174#L205-1 assume !(0 != main_~p12~0#1); 17170#L210-1 assume !(0 != main_~p13~0#1); 17166#L215-1 assume 0 != main_~p14~0#1; 17164#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 17162#L220 assume !(0 != main_~p15~0#1); 16954#L225-1 [2021-12-28 09:15:21,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-28 09:15:21,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890023046] [2021-12-28 09:15:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,934 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:21,944 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:21,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:21,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1790533308, now seen corresponding path program 1 times [2021-12-28 09:15:21,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:21,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969826139] [2021-12-28 09:15:21,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:21,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:15:21,958 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-28 09:15:21,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:15:21,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969826139] [2021-12-28 09:15:21,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969826139] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:15:21,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:15:21,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 09:15:21,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235300094] [2021-12-28 09:15:21,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:15:21,960 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:15:21,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:15:21,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:15:21,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:15:21,963 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-28 09:15:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:15:22,026 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2021-12-28 09:15:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:15:22,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16130 transitions. [2021-12-28 09:15:22,072 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-12-28 09:15:22,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16130 transitions. [2021-12-28 09:15:22,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2021-12-28 09:15:22,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2021-12-28 09:15:22,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16130 transitions. [2021-12-28 09:15:22,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:15:22,209 INFO L681 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-12-28 09:15:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16130 transitions. [2021-12-28 09:15:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2021-12-28 09:15:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 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-28 09:15:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16130 transitions. [2021-12-28 09:15:22,451 INFO L704 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-12-28 09:15:22,451 INFO L587 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-12-28 09:15:22,451 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-28 09:15:22,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16130 transitions. [2021-12-28 09:15:22,488 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-12-28 09:15:22,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:22,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:22,489 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:22,489 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:22,489 INFO L791 eck$LassoCheckResult]: Stem: 33550#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 33536#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33537#L225-1 [2021-12-28 09:15:22,489 INFO L793 eck$LassoCheckResult]: Loop: 33537#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33841#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 33839#L93 assume !(0 != main_~p1~0#1); 33838#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 33837#L97-1 assume !(0 != main_~p3~0#1); 33835#L101-1 assume !(0 != main_~p4~0#1); 33833#L105-1 assume !(0 != main_~p5~0#1); 33831#L109-1 assume !(0 != main_~p6~0#1); 33830#L113-1 assume !(0 != main_~p7~0#1); 33828#L117-1 assume !(0 != main_~p8~0#1); 33824#L121-1 assume !(0 != main_~p9~0#1); 33821#L125-1 assume !(0 != main_~p10~0#1); 33815#L129-1 assume !(0 != main_~p11~0#1); 33816#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 33807#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 33808#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 33799#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 33800#L149-1 assume !(0 != main_~p1~0#1); 33789#L155-1 assume 0 != main_~p2~0#1; 33790#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 33781#L160 assume !(0 != main_~p3~0#1); 33780#L165-1 assume !(0 != main_~p4~0#1); 33720#L170-1 assume !(0 != main_~p5~0#1); 33721#L175-1 assume !(0 != main_~p6~0#1); 33711#L180-1 assume !(0 != main_~p7~0#1); 33712#L185-1 assume !(0 != main_~p8~0#1); 33699#L190-1 assume !(0 != main_~p9~0#1); 33701#L195-1 assume !(0 != main_~p10~0#1); 33851#L200-1 assume !(0 != main_~p11~0#1); 33849#L205-1 assume !(0 != main_~p12~0#1); 33847#L210-1 assume !(0 != main_~p13~0#1); 33845#L215-1 assume 0 != main_~p14~0#1; 33844#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 33843#L220 assume !(0 != main_~p15~0#1); 33537#L225-1 [2021-12-28 09:15:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-12-28 09:15:22,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:22,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046868893] [2021-12-28 09:15:22,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:22,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:22,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:22,495 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:22,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:22,496 INFO L85 PathProgramCache]: Analyzing trace with hash 698995654, now seen corresponding path program 1 times [2021-12-28 09:15:22,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:22,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286978809] [2021-12-28 09:15:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:22,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:15:22,513 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-28 09:15:22,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:15:22,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286978809] [2021-12-28 09:15:22,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286978809] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:15:22,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:15:22,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 09:15:22,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605266366] [2021-12-28 09:15:22,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:15:22,515 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:15:22,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:15:22,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:15:22,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:15:22,515 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-28 09:15:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:15:22,562 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2021-12-28 09:15:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:15:22,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 31490 transitions. [2021-12-28 09:15:22,694 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-12-28 09:15:22,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 31490 transitions. [2021-12-28 09:15:22,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2021-12-28 09:15:22,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2021-12-28 09:15:22,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 31490 transitions. [2021-12-28 09:15:22,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:15:22,776 INFO L681 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-12-28 09:15:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 31490 transitions. [2021-12-28 09:15:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2021-12-28 09:15:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 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-28 09:15:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 31490 transitions. [2021-12-28 09:15:23,092 INFO L704 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-12-28 09:15:23,092 INFO L587 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-12-28 09:15:23,092 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-28 09:15:23,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 31490 transitions. [2021-12-28 09:15:23,158 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-12-28 09:15:23,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:23,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:23,159 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:23,159 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:23,159 INFO L791 eck$LassoCheckResult]: Stem: 66321#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 66308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66309#L225-1 [2021-12-28 09:15:23,159 INFO L793 eck$LassoCheckResult]: Loop: 66309#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66490#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 66486#L93 assume !(0 != main_~p1~0#1); 66484#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 66482#L97-1 assume !(0 != main_~p3~0#1); 66478#L101-1 assume !(0 != main_~p4~0#1); 66474#L105-1 assume !(0 != main_~p5~0#1); 66472#L109-1 assume !(0 != main_~p6~0#1); 66468#L113-1 assume !(0 != main_~p7~0#1); 66464#L117-1 assume !(0 != main_~p8~0#1); 66460#L121-1 assume !(0 != main_~p9~0#1); 66456#L125-1 assume !(0 != main_~p10~0#1); 66454#L129-1 assume !(0 != main_~p11~0#1); 66450#L133-1 assume !(0 != main_~p12~0#1); 66448#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66446#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66444#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66440#L149-1 assume !(0 != main_~p1~0#1); 66438#L155-1 assume 0 != main_~p2~0#1; 66436#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 66433#L160 assume !(0 != main_~p3~0#1); 66428#L165-1 assume !(0 != main_~p4~0#1); 66424#L170-1 assume !(0 != main_~p5~0#1); 66421#L175-1 assume !(0 != main_~p6~0#1); 66422#L180-1 assume !(0 != main_~p7~0#1); 66521#L185-1 assume !(0 != main_~p8~0#1); 66517#L190-1 assume !(0 != main_~p9~0#1); 66513#L195-1 assume !(0 != main_~p10~0#1); 66510#L200-1 assume !(0 != main_~p11~0#1); 66505#L205-1 assume !(0 != main_~p12~0#1); 66502#L210-1 assume !(0 != main_~p13~0#1); 66499#L215-1 assume 0 != main_~p14~0#1; 66497#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 66494#L220 assume !(0 != main_~p15~0#1); 66309#L225-1 [2021-12-28 09:15:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-12-28 09:15:23,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:23,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396540537] [2021-12-28 09:15:23,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:23,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:23,163 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:23,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:23,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1121697480, now seen corresponding path program 1 times [2021-12-28 09:15:23,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:23,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18187941] [2021-12-28 09:15:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:23,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:15:23,180 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-28 09:15:23,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:15:23,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18187941] [2021-12-28 09:15:23,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18187941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:15:23,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:15:23,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 09:15:23,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581620688] [2021-12-28 09:15:23,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:15:23,181 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:15:23,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:15:23,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:15:23,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:15:23,182 INFO L87 Difference]: Start difference. First operand 21762 states and 31490 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-28 09:15:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:15:23,379 INFO L93 Difference]: Finished difference Result 43010 states and 61442 transitions. [2021-12-28 09:15:23,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:15:23,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 61442 transitions. [2021-12-28 09:15:23,549 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-12-28 09:15:23,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 61442 transitions. [2021-12-28 09:15:23,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2021-12-28 09:15:23,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2021-12-28 09:15:23,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 61442 transitions. [2021-12-28 09:15:23,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:15:23,860 INFO L681 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-12-28 09:15:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 61442 transitions. [2021-12-28 09:15:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2021-12-28 09:15:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4285514996512438) internal successors, (61442), 43009 states have internal predecessors, (61442), 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-28 09:15:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 61442 transitions. [2021-12-28 09:15:24,456 INFO L704 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-12-28 09:15:24,456 INFO L587 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-12-28 09:15:24,457 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-28 09:15:24,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 61442 transitions. [2021-12-28 09:15:24,752 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-12-28 09:15:24,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:24,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:24,753 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:24,753 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:24,753 INFO L791 eck$LassoCheckResult]: Stem: 131107#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 131095#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131096#L225-1 [2021-12-28 09:15:24,754 INFO L793 eck$LassoCheckResult]: Loop: 131096#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 132419#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 132416#L93 assume !(0 != main_~p1~0#1); 132413#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 132411#L97-1 assume !(0 != main_~p3~0#1); 132408#L101-1 assume !(0 != main_~p4~0#1); 132404#L105-1 assume !(0 != main_~p5~0#1); 132400#L109-1 assume !(0 != main_~p6~0#1); 132396#L113-1 assume !(0 != main_~p7~0#1); 132392#L117-1 assume !(0 != main_~p8~0#1); 132388#L121-1 assume !(0 != main_~p9~0#1); 132384#L125-1 assume !(0 != main_~p10~0#1); 132381#L129-1 assume !(0 != main_~p11~0#1); 132378#L133-1 assume !(0 != main_~p12~0#1); 132379#L137-1 assume !(0 != main_~p13~0#1); 132483#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 132481#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 132476#L149-1 assume !(0 != main_~p1~0#1); 132474#L155-1 assume 0 != main_~p2~0#1; 132472#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 132304#L160 assume !(0 != main_~p3~0#1); 132303#L165-1 assume !(0 != main_~p4~0#1); 132269#L170-1 assume !(0 != main_~p5~0#1); 132270#L175-1 assume !(0 != main_~p6~0#1); 132246#L180-1 assume !(0 != main_~p7~0#1); 132247#L185-1 assume !(0 != main_~p8~0#1); 132158#L190-1 assume !(0 != main_~p9~0#1); 132160#L195-1 assume !(0 != main_~p10~0#1); 132436#L200-1 assume !(0 != main_~p11~0#1); 132431#L205-1 assume !(0 != main_~p12~0#1); 132429#L210-1 assume !(0 != main_~p13~0#1); 132428#L215-1 assume 0 != main_~p14~0#1; 132426#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 132424#L220 assume !(0 != main_~p15~0#1); 131096#L225-1 [2021-12-28 09:15:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-12-28 09:15:24,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:24,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803966821] [2021-12-28 09:15:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:24,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:24,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:24,768 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash 304049030, now seen corresponding path program 1 times [2021-12-28 09:15:24,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:24,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474976800] [2021-12-28 09:15:24,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:24,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:15:24,784 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-28 09:15:24,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:15:24,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474976800] [2021-12-28 09:15:24,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474976800] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:15:24,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:15:24,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 09:15:24,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942589849] [2021-12-28 09:15:24,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:15:24,785 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:15:24,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:15:24,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:15:24,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:15:24,786 INFO L87 Difference]: Start difference. First operand 43010 states and 61442 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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-28 09:15:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:15:25,064 INFO L93 Difference]: Finished difference Result 84994 states and 119810 transitions. [2021-12-28 09:15:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:15:25,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 119810 transitions. [2021-12-28 09:15:25,595 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-12-28 09:15:25,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 119810 transitions. [2021-12-28 09:15:25,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2021-12-28 09:15:25,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2021-12-28 09:15:25,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 119810 transitions. [2021-12-28 09:15:25,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:15:25,936 INFO L681 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-12-28 09:15:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 119810 transitions. [2021-12-28 09:15:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2021-12-28 09:15:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.409628914982234) internal successors, (119810), 84993 states have internal predecessors, (119810), 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-28 09:15:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 119810 transitions. [2021-12-28 09:15:26,867 INFO L704 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-12-28 09:15:26,867 INFO L587 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-12-28 09:15:26,867 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-28 09:15:26,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 119810 transitions. [2021-12-28 09:15:27,240 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-12-28 09:15:27,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:15:27,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:15:27,242 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:15:27,252 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:15:27,252 INFO L791 eck$LassoCheckResult]: Stem: 259110#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 259098#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259099#L225-1 [2021-12-28 09:15:27,252 INFO L793 eck$LassoCheckResult]: Loop: 259099#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 260713#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 260700#L93 assume !(0 != main_~p1~0#1); 260702#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 260686#L97-1 assume !(0 != main_~p3~0#1); 260687#L101-1 assume !(0 != main_~p4~0#1); 260670#L105-1 assume !(0 != main_~p5~0#1); 260672#L109-1 assume !(0 != main_~p6~0#1); 260644#L113-1 assume !(0 != main_~p7~0#1); 260646#L117-1 assume !(0 != main_~p8~0#1); 260618#L121-1 assume !(0 != main_~p9~0#1); 260620#L125-1 assume !(0 != main_~p10~0#1); 260839#L129-1 assume !(0 != main_~p11~0#1); 260837#L133-1 assume !(0 != main_~p12~0#1); 260833#L137-1 assume !(0 != main_~p13~0#1); 260830#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 260827#L145-1 assume !(0 != main_~p15~0#1); 260824#L149-1 assume !(0 != main_~p1~0#1); 260821#L155-1 assume 0 != main_~p2~0#1; 260818#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 260796#L160 assume !(0 != main_~p3~0#1); 260787#L165-1 assume !(0 != main_~p4~0#1); 260779#L170-1 assume !(0 != main_~p5~0#1); 260771#L175-1 assume !(0 != main_~p6~0#1); 260765#L180-1 assume !(0 != main_~p7~0#1); 260761#L185-1 assume !(0 != main_~p8~0#1); 260758#L190-1 assume !(0 != main_~p9~0#1); 260756#L195-1 assume !(0 != main_~p10~0#1); 260753#L200-1 assume !(0 != main_~p11~0#1); 260730#L205-1 assume !(0 != main_~p12~0#1); 260732#L210-1 assume !(0 != main_~p13~0#1); 260746#L215-1 assume 0 != main_~p14~0#1; 260738#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 260739#L220 assume !(0 != main_~p15~0#1); 259099#L225-1 [2021-12-28 09:15:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:27,253 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-12-28 09:15:27,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:27,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263375946] [2021-12-28 09:15:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:27,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:27,255 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:27,257 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:27,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1690095676, now seen corresponding path program 1 times [2021-12-28 09:15:27,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:27,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941304769] [2021-12-28 09:15:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:27,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:27,261 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:27,267 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:15:27,267 INFO L85 PathProgramCache]: Analyzing trace with hash 365150982, now seen corresponding path program 1 times [2021-12-28 09:15:27,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:15:27,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44709555] [2021-12-28 09:15:27,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:15:27,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:15:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:27,271 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:15:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:15:27,276 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:15:27,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.12 09:15:27 BoogieIcfgContainer [2021-12-28 09:15:27,602 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-28 09:15:27,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 09:15:27,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 09:15:27,602 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 09:15:27,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:15:20" (3/4) ... [2021-12-28 09:15:27,604 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-28 09:15:27,629 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 09:15:27,630 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 09:15:27,630 INFO L158 Benchmark]: Toolchain (without parser) took 7703.27ms. Allocated memory was 60.8MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 45.3MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 661.1MB. Max. memory is 16.1GB. [2021-12-28 09:15:27,631 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 46.1MB. Free memory was 28.2MB in the beginning and 28.1MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:15:27,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.20ms. Allocated memory is still 60.8MB. Free memory was 45.1MB in the beginning and 44.2MB in the end (delta: 879.3kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-28 09:15:27,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.18ms. Allocated memory is still 60.8MB. Free memory was 44.2MB in the beginning and 42.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 09:15:27,631 INFO L158 Benchmark]: Boogie Preprocessor took 16.06ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 41.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:15:27,632 INFO L158 Benchmark]: RCFGBuilder took 304.40ms. Allocated memory is still 60.8MB. Free memory was 40.9MB in the beginning and 41.1MB in the end (delta: -145.4kB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2021-12-28 09:15:27,632 INFO L158 Benchmark]: BuchiAutomizer took 7127.39ms. Allocated memory was 60.8MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 40.9MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 654.2MB. Max. memory is 16.1GB. [2021-12-28 09:15:27,632 INFO L158 Benchmark]: Witness Printer took 27.68ms. Allocated memory is still 5.1GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 09:15:27,633 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.18ms. Allocated memory is still 46.1MB. Free memory was 28.2MB in the beginning and 28.1MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.20ms. Allocated memory is still 60.8MB. Free memory was 45.1MB in the beginning and 44.2MB in the end (delta: 879.3kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.18ms. Allocated memory is still 60.8MB. Free memory was 44.2MB in the beginning and 42.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.06ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 41.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 304.40ms. Allocated memory is still 60.8MB. Free memory was 40.9MB in the beginning and 41.1MB in the end (delta: -145.4kB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 7127.39ms. Allocated memory was 60.8MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 40.9MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 654.2MB. Max. memory is 16.1GB. * Witness Printer took 27.68ms. Allocated memory is still 5.1GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 3.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 84994 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.5s Buchi closure took 0.0s. Biggest automaton had 84994 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 648 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 648 mSDsluCounter, 2072 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 801 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1271 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: 56]: 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, p9=0, NULL=1, cond=5, p12=0, p10=0, p14=6, p8=0, lk6=0, lk15=0, p3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b4e3954=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@255a99b1=0, p15=0, \result=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fdb1dfd=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55532e5f=0, lk14=0, p2=4, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41480774=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@620cdbee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a69c9d2=0, lk13=0, lk9=0, lk12=0, p5=0, lk2=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8aaa1f7=0, lk11=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78ca8f24=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12b4be6c=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b098a1c=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62a3bd47=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24b5ac69=0, p6=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@755b6754=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5df0a5d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3684288b=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: 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; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND TRUE p2 != 0 [L98] lk2 = 1 [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND TRUE p14 != 0 [L146] lk14 = 1 [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND TRUE p2 != 0 [L161] COND FALSE !(lk2 != 1) [L162] lk2 = 0 [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND TRUE p14 != 0 [L221] COND FALSE !(lk14 != 1) [L222] lk14 = 0 [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-28 09:15:27,674 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)