./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_6.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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 09:34:15,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 09:34:15,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 09:34:15,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 09:34:15,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 09:34:15,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 09:34:15,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 09:34:15,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 09:34:15,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 09:34:15,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 09:34:15,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 09:34:15,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 09:34:15,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 09:34:15,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 09:34:15,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 09:34:15,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 09:34:15,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 09:34:15,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 09:34:15,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 09:34:15,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 09:34:15,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 09:34:15,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 09:34:15,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 09:34:15,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 09:34:15,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 09:34:15,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 09:34:15,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 09:34:15,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 09:34:15,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 09:34:15,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 09:34:15,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 09:34:15,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 09:34:15,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 09:34:15,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 09:34:15,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 09:34:15,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 09:34:15,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 09:34:15,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 09:34:15,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 09:34:15,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 09:34:15,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 09:34:15,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 09:34:15,482 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 09:34:15,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 09:34:15,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 09:34:15,484 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 09:34:15,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 09:34:15,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 09:34:15,485 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 09:34:15,485 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 09:34:15,486 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 09:34:15,486 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 09:34:15,486 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 09:34:15,486 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 09:34:15,487 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 09:34:15,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 09:34:15,487 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 09:34:15,487 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 09:34:15,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 09:34:15,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 09:34:15,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 09:34:15,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 09:34:15,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 09:34:15,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 09:34:15,488 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 09:34:15,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 09:34:15,488 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 09:34:15,489 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 09:34:15,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 09:34:15,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 09:34:15,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 09:34:15,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 09:34:15,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 09:34:15,490 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 09:34:15,490 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 09:34:15,490 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2021-12-16 09:34:15,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 09:34:15,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 09:34:15,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 09:34:15,654 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 09:34:15,654 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 09:34:15,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2021-12-16 09:34:15,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86c5a1a9/dfaa4dbf1aec4b22beb34deed7a3712f/FLAGfee523b7a [2021-12-16 09:34:16,047 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 09:34:16,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2021-12-16 09:34:16,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86c5a1a9/dfaa4dbf1aec4b22beb34deed7a3712f/FLAGfee523b7a [2021-12-16 09:34:16,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86c5a1a9/dfaa4dbf1aec4b22beb34deed7a3712f [2021-12-16 09:34:16,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 09:34:16,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 09:34:16,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 09:34:16,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 09:34:16,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 09:34:16,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a3733d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16, skipping insertion in model container [2021-12-16 09:34:16,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 09:34:16,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 09:34:16,235 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_6.c[2544,2557] [2021-12-16 09:34:16,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:34:16,241 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 09:34:16,254 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_6.c[2544,2557] [2021-12-16 09:34:16,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:34:16,262 INFO L208 MainTranslator]: Completed translation [2021-12-16 09:34:16,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16 WrapperNode [2021-12-16 09:34:16,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 09:34:16,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 09:34:16,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 09:34:16,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 09:34:16,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,283 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 87 [2021-12-16 09:34:16,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 09:34:16,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 09:34:16,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 09:34:16,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 09:34:16,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 09:34:16,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 09:34:16,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 09:34:16,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 09:34:16,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16" (1/1) ... [2021-12-16 09:34:16,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:34:16,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:34:16,321 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-16 09:34:16,347 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-16 09:34:16,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 09:34:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 09:34:16,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 09:34:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 09:34:16,396 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 09:34:16,397 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 09:34:16,477 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 09:34:16,481 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 09:34:16,481 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 09:34:16,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:34:16 BoogieIcfgContainer [2021-12-16 09:34:16,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 09:34:16,483 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 09:34:16,483 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 09:34:16,486 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 09:34:16,486 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:34:16,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 09:34:16" (1/3) ... [2021-12-16 09:34:16,487 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15a5ba6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:34:16, skipping insertion in model container [2021-12-16 09:34:16,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:34:16,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:34:16" (2/3) ... [2021-12-16 09:34:16,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15a5ba6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:34:16, skipping insertion in model container [2021-12-16 09:34:16,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:34:16,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:34:16" (3/3) ... [2021-12-16 09:34:16,489 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2021-12-16 09:34:16,517 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 09:34:16,517 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 09:34:16,517 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 09:34:16,517 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 09:34:16,517 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 09:34:16,518 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 09:34:16,518 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 09:34:16,518 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 09:34:16,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 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-16 09:34:16,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-16 09:34:16,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:34:16,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:34:16,541 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:34:16,542 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:34:16,542 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 09:34:16,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 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-16 09:34:16,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-16 09:34:16,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:34:16,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:34:16,545 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:34:16,545 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:34:16,549 INFO L791 eck$LassoCheckResult]: Stem: 17#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(15, 2);call #Ultimate.allocInit(12, 3); 9#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_~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_~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;havoc main_~cond~0#1; 12#L99-1true [2021-12-16 09:34:16,549 INFO L793 eck$LassoCheckResult]: Loop: 12#L99-1true assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 8#L31true 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; 15#L48true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 4#L48-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 28#L52-1true assume !(0 != main_~p3~0#1); 21#L56-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L60-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 25#L64-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 24#L68-1true assume !(0 != main_~p1~0#1); 27#L74-1true assume !(0 != main_~p2~0#1); 13#L79-1true assume !(0 != main_~p3~0#1); 23#L84-1true assume !(0 != main_~p4~0#1); 14#L89-1true assume !(0 != main_~p5~0#1); 11#L94-1true assume !(0 != main_~p6~0#1); 12#L99-1true [2021-12-16 09:34:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-16 09:34:16,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:16,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480818766] [2021-12-16 09:34:16,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:16,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:16,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:34:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:16,674 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:34:16,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:16,681 INFO L85 PathProgramCache]: Analyzing trace with hash -11500681, now seen corresponding path program 1 times [2021-12-16 09:34:16,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:16,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122752080] [2021-12-16 09:34:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:16,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:34:16,763 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-16 09:34:16,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:34:16,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122752080] [2021-12-16 09:34:16,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122752080] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:34:16,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:34:16,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:34:16,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26473906] [2021-12-16 09:34:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:34:16,770 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:34:16,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:34:16,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:34:16,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:34:16,795 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 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 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 09:34:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:34:16,830 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2021-12-16 09:34:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:34:16,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 82 transitions. [2021-12-16 09:34:16,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-16 09:34:16,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 41 states and 63 transitions. [2021-12-16 09:34:16,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-12-16 09:34:16,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-12-16 09:34:16,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2021-12-16 09:34:16,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:34:16,848 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-12-16 09:34:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2021-12-16 09:34:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-12-16 09:34:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 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-16 09:34:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2021-12-16 09:34:16,868 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-12-16 09:34:16,868 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-12-16 09:34:16,868 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 09:34:16,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2021-12-16 09:34:16,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-16 09:34:16,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:34:16,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:34:16,871 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:34:16,871 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:34:16,872 INFO L791 eck$LassoCheckResult]: Stem: 89#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(15, 2);call #Ultimate.allocInit(12, 3); 90#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_~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_~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;havoc main_~cond~0#1; 104#L99-1 [2021-12-16 09:34:16,872 INFO L793 eck$LassoCheckResult]: Loop: 104#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 119#L31 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; 118#L48 assume !(0 != main_~p1~0#1); 87#L48-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 88#L52-1 assume !(0 != main_~p3~0#1); 117#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 116#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 115#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 114#L68-1 assume !(0 != main_~p1~0#1); 111#L74-1 assume !(0 != main_~p2~0#1); 109#L79-1 assume !(0 != main_~p3~0#1); 92#L84-1 assume !(0 != main_~p4~0#1); 123#L89-1 assume !(0 != main_~p5~0#1); 121#L94-1 assume !(0 != main_~p6~0#1); 104#L99-1 [2021-12-16 09:34:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-16 09:34:16,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:16,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735567194] [2021-12-16 09:34:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:16,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:16,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:34:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:16,902 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:34:16,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash 246664757, now seen corresponding path program 1 times [2021-12-16 09:34:16,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:16,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120755638] [2021-12-16 09:34:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:16,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:34:16,935 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-16 09:34:16,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:34:16,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120755638] [2021-12-16 09:34:16,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120755638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:34:16,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:34:16,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:34:16,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103207101] [2021-12-16 09:34:16,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:34:16,937 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:34:16,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:34:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:34:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:34:16,938 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 09:34:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:34:16,947 INFO L93 Difference]: Finished difference Result 78 states and 118 transitions. [2021-12-16 09:34:16,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:34:16,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 118 transitions. [2021-12-16 09:34:16,949 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2021-12-16 09:34:16,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 118 transitions. [2021-12-16 09:34:16,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2021-12-16 09:34:16,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2021-12-16 09:34:16,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 118 transitions. [2021-12-16 09:34:16,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:34:16,951 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-12-16 09:34:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 118 transitions. [2021-12-16 09:34:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-16 09:34:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 77 states have internal predecessors, (118), 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-16 09:34:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2021-12-16 09:34:16,955 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-12-16 09:34:16,955 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-12-16 09:34:16,956 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 09:34:16,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 118 transitions. [2021-12-16 09:34:16,956 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2021-12-16 09:34:16,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:34:16,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:34:16,957 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:34:16,957 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:34:16,957 INFO L791 eck$LassoCheckResult]: Stem: 214#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(15, 2);call #Ultimate.allocInit(12, 3); 215#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_~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_~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;havoc main_~cond~0#1; 227#L99-1 [2021-12-16 09:34:16,957 INFO L793 eck$LassoCheckResult]: Loop: 227#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 263#L31 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; 259#L48 assume !(0 != main_~p1~0#1); 258#L48-2 assume !(0 != main_~p2~0#1); 257#L52-1 assume !(0 != main_~p3~0#1); 255#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 253#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 251#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 249#L68-1 assume !(0 != main_~p1~0#1); 240#L74-1 assume !(0 != main_~p2~0#1); 238#L79-1 assume !(0 != main_~p3~0#1); 217#L84-1 assume !(0 != main_~p4~0#1); 276#L89-1 assume !(0 != main_~p5~0#1); 272#L94-1 assume !(0 != main_~p6~0#1); 227#L99-1 [2021-12-16 09:34:16,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:16,958 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-16 09:34:16,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:16,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409875654] [2021-12-16 09:34:16,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:16,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:16,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:34:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:16,966 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:34:16,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:16,967 INFO L85 PathProgramCache]: Analyzing trace with hash 947729335, now seen corresponding path program 1 times [2021-12-16 09:34:16,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:16,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762407847] [2021-12-16 09:34:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:16,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:34:16,994 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-16 09:34:16,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:34:16,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762407847] [2021-12-16 09:34:16,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762407847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:34:16,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:34:16,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:34:16,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320084190] [2021-12-16 09:34:16,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:34:16,996 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:34:16,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:34:16,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:34:16,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:34:16,998 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 09:34:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:34:17,013 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2021-12-16 09:34:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:34:17,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 222 transitions. [2021-12-16 09:34:17,019 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2021-12-16 09:34:17,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 222 transitions. [2021-12-16 09:34:17,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2021-12-16 09:34:17,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2021-12-16 09:34:17,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 222 transitions. [2021-12-16 09:34:17,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:34:17,023 INFO L681 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-12-16 09:34:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 222 transitions. [2021-12-16 09:34:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-16 09:34:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.48) internal successors, (222), 149 states have internal predecessors, (222), 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-16 09:34:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2021-12-16 09:34:17,044 INFO L704 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-12-16 09:34:17,044 INFO L587 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-12-16 09:34:17,044 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 09:34:17,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 222 transitions. [2021-12-16 09:34:17,045 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2021-12-16 09:34:17,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:34:17,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:34:17,045 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:34:17,045 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:34:17,046 INFO L791 eck$LassoCheckResult]: Stem: 448#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(15, 2);call #Ultimate.allocInit(12, 3); 449#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_~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_~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;havoc main_~cond~0#1; 461#L99-1 [2021-12-16 09:34:17,046 INFO L793 eck$LassoCheckResult]: Loop: 461#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 503#L31 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; 498#L48 assume !(0 != main_~p1~0#1); 492#L48-2 assume !(0 != main_~p2~0#1); 485#L52-1 assume !(0 != main_~p3~0#1); 486#L56-1 assume !(0 != main_~p4~0#1); 546#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 545#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 539#L68-1 assume !(0 != main_~p1~0#1); 541#L74-1 assume !(0 != main_~p2~0#1); 538#L79-1 assume !(0 != main_~p3~0#1); 536#L84-1 assume !(0 != main_~p4~0#1); 535#L89-1 assume !(0 != main_~p5~0#1); 517#L94-1 assume !(0 != main_~p6~0#1); 461#L99-1 [2021-12-16 09:34:17,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:17,046 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-16 09:34:17,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:17,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050405944] [2021-12-16 09:34:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:17,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:17,050 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:34:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:17,063 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:34:17,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:17,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1627787705, now seen corresponding path program 1 times [2021-12-16 09:34:17,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:17,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622887188] [2021-12-16 09:34:17,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:17,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:34:17,078 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-16 09:34:17,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:34:17,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622887188] [2021-12-16 09:34:17,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622887188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:34:17,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:34:17,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:34:17,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934641144] [2021-12-16 09:34:17,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:34:17,079 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:34:17,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:34:17,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:34:17,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:34:17,080 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 09:34:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:34:17,098 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2021-12-16 09:34:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:34:17,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 418 transitions. [2021-12-16 09:34:17,103 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2021-12-16 09:34:17,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 418 transitions. [2021-12-16 09:34:17,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2021-12-16 09:34:17,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2021-12-16 09:34:17,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 418 transitions. [2021-12-16 09:34:17,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:34:17,111 INFO L681 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-12-16 09:34:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 418 transitions. [2021-12-16 09:34:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2021-12-16 09:34:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 290 states have (on average 1.4413793103448276) internal successors, (418), 289 states have internal predecessors, (418), 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-16 09:34:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 418 transitions. [2021-12-16 09:34:17,124 INFO L704 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-12-16 09:34:17,124 INFO L587 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-12-16 09:34:17,124 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 09:34:17,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 418 transitions. [2021-12-16 09:34:17,125 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2021-12-16 09:34:17,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:34:17,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:34:17,126 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:34:17,126 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:34:17,126 INFO L791 eck$LassoCheckResult]: Stem: 894#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(15, 2);call #Ultimate.allocInit(12, 3); 895#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_~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_~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;havoc main_~cond~0#1; 907#L99-1 [2021-12-16 09:34:17,126 INFO L793 eck$LassoCheckResult]: Loop: 907#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 955#L31 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; 953#L48 assume !(0 != main_~p1~0#1); 949#L48-2 assume !(0 != main_~p2~0#1); 947#L52-1 assume !(0 != main_~p3~0#1); 943#L56-1 assume !(0 != main_~p4~0#1); 939#L60-1 assume !(0 != main_~p5~0#1); 937#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 934#L68-1 assume !(0 != main_~p1~0#1); 935#L74-1 assume !(0 != main_~p2~0#1); 971#L79-1 assume !(0 != main_~p3~0#1); 966#L84-1 assume !(0 != main_~p4~0#1); 962#L89-1 assume !(0 != main_~p5~0#1); 959#L94-1 assume !(0 != main_~p6~0#1); 907#L99-1 [2021-12-16 09:34:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-16 09:34:17,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:17,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340746445] [2021-12-16 09:34:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:17,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:17,130 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:34:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:17,134 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:34:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash 818441079, now seen corresponding path program 1 times [2021-12-16 09:34:17,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:17,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798167860] [2021-12-16 09:34:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:17,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:34:17,147 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-16 09:34:17,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:34:17,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798167860] [2021-12-16 09:34:17,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798167860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:34:17,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:34:17,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 09:34:17,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194873485] [2021-12-16 09:34:17,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:34:17,148 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:34:17,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:34:17,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:34:17,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:34:17,149 INFO L87 Difference]: Start difference. First operand 290 states and 418 transitions. cyclomatic complexity: 144 Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-16 09:34:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:34:17,157 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2021-12-16 09:34:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:34:17,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 786 transitions. [2021-12-16 09:34:17,160 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2021-12-16 09:34:17,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 786 transitions. [2021-12-16 09:34:17,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2021-12-16 09:34:17,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2021-12-16 09:34:17,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 786 transitions. [2021-12-16 09:34:17,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:34:17,164 INFO L681 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-12-16 09:34:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 786 transitions. [2021-12-16 09:34:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-12-16 09:34:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 562 states have (on average 1.398576512455516) internal successors, (786), 561 states have internal predecessors, (786), 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-16 09:34:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2021-12-16 09:34:17,186 INFO L704 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-12-16 09:34:17,186 INFO L587 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-12-16 09:34:17,186 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 09:34:17,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 786 transitions. [2021-12-16 09:34:17,188 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2021-12-16 09:34:17,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:34:17,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:34:17,189 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:34:17,189 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:34:17,189 INFO L791 eck$LassoCheckResult]: Stem: 1752#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(15, 2);call #Ultimate.allocInit(12, 3); 1753#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_~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_~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;havoc main_~cond~0#1; 1765#L99-1 [2021-12-16 09:34:17,189 INFO L793 eck$LassoCheckResult]: Loop: 1765#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 1846#L31 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; 1842#L48 assume !(0 != main_~p1~0#1); 1835#L48-2 assume !(0 != main_~p2~0#1); 1830#L52-1 assume !(0 != main_~p3~0#1); 1823#L56-1 assume !(0 != main_~p4~0#1); 1815#L60-1 assume !(0 != main_~p5~0#1); 1809#L64-1 assume !(0 != main_~p6~0#1); 1803#L68-1 assume !(0 != main_~p1~0#1); 1804#L74-1 assume !(0 != main_~p2~0#1); 1873#L79-1 assume !(0 != main_~p3~0#1); 1864#L84-1 assume !(0 != main_~p4~0#1); 1857#L89-1 assume !(0 != main_~p5~0#1); 1853#L94-1 assume !(0 != main_~p6~0#1); 1765#L99-1 [2021-12-16 09:34:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:17,190 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-16 09:34:17,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:17,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065766565] [2021-12-16 09:34:17,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:17,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:17,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:34:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:17,203 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:34:17,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:17,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1701518855, now seen corresponding path program 1 times [2021-12-16 09:34:17,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:17,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775849828] [2021-12-16 09:34:17,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:17,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:17,210 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:34:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:17,215 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:34:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:34:17,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1159342651, now seen corresponding path program 1 times [2021-12-16 09:34:17,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:34:17,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569389834] [2021-12-16 09:34:17,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:34:17,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:34:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:17,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:34:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:34:17,235 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:34:17,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.12 09:34:17 BoogieIcfgContainer [2021-12-16 09:34:17,453 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-16 09:34:17,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 09:34:17,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 09:34:17,453 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 09:34:17,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:34:16" (3/4) ... [2021-12-16 09:34:17,455 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-16 09:34:17,485 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 09:34:17,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 09:34:17,486 INFO L158 Benchmark]: Toolchain (without parser) took 1418.60ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 54.1MB in the beginning and 45.2MB in the end (delta: 8.8MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2021-12-16 09:34:17,486 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 86.0MB. Free memory was 42.3MB in the beginning and 42.3MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 09:34:17,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.25ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 53.8MB in the beginning and 83.7MB in the end (delta: -29.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 09:34:17,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.50ms. Allocated memory is still 107.0MB. Free memory was 83.7MB in the beginning and 82.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 09:34:17,488 INFO L158 Benchmark]: Boogie Preprocessor took 13.08ms. Allocated memory is still 107.0MB. Free memory was 82.2MB in the beginning and 80.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 09:34:17,488 INFO L158 Benchmark]: RCFGBuilder took 185.08ms. Allocated memory is still 107.0MB. Free memory was 80.7MB in the beginning and 70.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 09:34:17,488 INFO L158 Benchmark]: BuchiAutomizer took 969.35ms. Allocated memory is still 107.0MB. Free memory was 70.8MB in the beginning and 47.3MB in the end (delta: 23.5MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2021-12-16 09:34:17,489 INFO L158 Benchmark]: Witness Printer took 32.62ms. Allocated memory is still 107.0MB. Free memory was 47.3MB in the beginning and 45.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 09:34:17,491 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.14ms. Allocated memory is still 86.0MB. Free memory was 42.3MB in the beginning and 42.3MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.25ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 53.8MB in the beginning and 83.7MB in the end (delta: -29.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.50ms. Allocated memory is still 107.0MB. Free memory was 83.7MB in the beginning and 82.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.08ms. Allocated memory is still 107.0MB. Free memory was 82.2MB in the beginning and 80.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 185.08ms. Allocated memory is still 107.0MB. Free memory was 80.7MB in the beginning and 70.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 969.35ms. Allocated memory is still 107.0MB. Free memory was 70.8MB in the beginning and 47.3MB in the end (delta: 23.5MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Witness Printer took 32.62ms. Allocated memory is still 107.0MB. Free memory was 47.3MB in the beginning and 45.2MB in the end (delta: 2.1MB). 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 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 562 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 562 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 405 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 256 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI5 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: 29]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@563a7222=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4af74bbe=0, lk5=0, p1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49c90c9=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29aa9c07=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fc84a79=0, NULL=1, \result=0, cond=4, p5=0, lk2=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71685687=4, p6=0, NULL=0, p2=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74c6815f=0, lk6=0, lk1=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: 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; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-16 09:34:17,538 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)