./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_8.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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:30:02,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:30:02,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:30:02,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:30:02,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:30:02,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:30:02,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:30:02,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:30:02,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:30:02,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:30:02,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:30:02,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:30:02,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:30:02,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:30:02,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:30:02,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:30:02,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:30:02,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:30:02,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:30:02,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:30:02,484 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:30:02,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:30:02,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:30:02,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:30:02,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:30:02,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:30:02,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:30:02,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:30:02,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:30:02,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:30:02,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:30:02,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:30:02,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:30:02,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:30:02,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:30:02,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:30:02,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:30:02,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:30:02,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:30:02,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:30:02,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:30:02,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:30:02,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:30:02,529 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:30:02,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:30:02,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:30:02,530 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:30:02,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:30:02,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:30:02,531 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:30:02,531 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:30:02,532 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:30:02,532 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:30:02,532 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:30:02,533 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:30:02,533 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:30:02,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:30:02,533 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:30:02,534 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:30:02,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:30:02,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:30:02,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:30:02,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:30:02,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:30:02,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:30:02,535 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:30:02,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:30:02,535 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:30:02,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:30:02,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:30:02,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:30:02,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:30:02,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:30:02,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:30:02,538 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:30:02,538 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2022-07-13 03:30:02,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:30:02,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:30:02,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:30:02,769 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:30:02,769 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:30:02,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2022-07-13 03:30:02,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f247519f7/67329515c34a43b6a73dc2f9501647cb/FLAGd2fdeb205 [2022-07-13 03:30:03,187 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:30:03,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2022-07-13 03:30:03,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f247519f7/67329515c34a43b6a73dc2f9501647cb/FLAGd2fdeb205 [2022-07-13 03:30:03,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f247519f7/67329515c34a43b6a73dc2f9501647cb [2022-07-13 03:30:03,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:30:03,210 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:30:03,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:30:03,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:30:03,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:30:03,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef60cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03, skipping insertion in model container [2022-07-13 03:30:03,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:30:03,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:30:03,404 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_8.c[3218,3231] [2022-07-13 03:30:03,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:30:03,412 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:30:03,440 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_8.c[3218,3231] [2022-07-13 03:30:03,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:30:03,454 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:30:03,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03 WrapperNode [2022-07-13 03:30:03,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:30:03,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:30:03,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:30:03,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:30:03,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,484 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 107 [2022-07-13 03:30:03,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:30:03,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:30:03,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:30:03,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:30:03,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:30:03,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:30:03,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:30:03,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:30:03,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03" (1/1) ... [2022-07-13 03:30:03,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:30:03,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:30:03,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:30:03,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:30:03,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:30:03,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:30:03,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:30:03,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:30:03,635 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:30:03,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:30:03,809 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:30:03,813 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:30:03,813 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 03:30:03,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:30:03 BoogieIcfgContainer [2022-07-13 03:30:03,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:30:03,815 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:30:03,831 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:30:03,833 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:30:03,834 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:30:03,835 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:30:03" (1/3) ... [2022-07-13 03:30:03,836 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fbda3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:30:03, skipping insertion in model container [2022-07-13 03:30:03,836 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:30:03,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:03" (2/3) ... [2022-07-13 03:30:03,836 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fbda3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:30:03, skipping insertion in model container [2022-07-13 03:30:03,836 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:30:03,837 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:30:03" (3/3) ... [2022-07-13 03:30:03,837 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2022-07-13 03:30:03,883 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:30:03,884 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:30:03,884 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:30:03,884 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:30:03,884 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:30:03,884 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:30:03,884 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:30:03,884 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:30:03,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:03,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-07-13 03:30:03,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:03,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:03,906 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:03,906 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:03,906 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:30:03,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:03,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-07-13 03:30:03,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:03,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:03,911 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:03,911 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:03,917 INFO L752 eck$LassoCheckResult]: Stem: 18#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); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~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_~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;havoc main_~cond~0#1; 21#L127-1true [2022-07-13 03:30:03,918 INFO L754 eck$LassoCheckResult]: Loop: 21#L127-1true assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 28#L37true 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; 6#L58true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 13#L58-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 15#L62-1true assume !(0 != main_~p3~0#1); 29#L66-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 30#L70-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 32#L74-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 26#L78-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 10#L82-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8#L86-1true assume !(0 != main_~p1~0#1); 5#L92-1true assume !(0 != main_~p2~0#1); 16#L97-1true assume !(0 != main_~p3~0#1); 23#L102-1true assume !(0 != main_~p4~0#1); 20#L107-1true assume !(0 != main_~p5~0#1); 33#L112-1true assume !(0 != main_~p6~0#1); 31#L117-1true assume !(0 != main_~p7~0#1); 11#L122-1true assume !(0 != main_~p8~0#1); 21#L127-1true [2022-07-13 03:30:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:30:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:03,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082077363] [2022-07-13 03:30:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:03,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:03,992 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:04,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2022-07-13 03:30:04,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595354555] [2022-07-13 03:30:04,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:04,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595354555] [2022-07-13 03:30:04,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595354555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:04,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:04,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:04,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754466880] [2022-07-13 03:30:04,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:04,100 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:04,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:04,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:04,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:04,127 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 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 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:04,151 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2022-07-13 03:30:04,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:04,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 106 transitions. [2022-07-13 03:30:04,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-07-13 03:30:04,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 83 transitions. [2022-07-13 03:30:04,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2022-07-13 03:30:04,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-07-13 03:30:04,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2022-07-13 03:30:04,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:04,170 INFO L369 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-07-13 03:30:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2022-07-13 03:30:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-13 03:30:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 52 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2022-07-13 03:30:04,193 INFO L392 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-07-13 03:30:04,193 INFO L374 stractBuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-07-13 03:30:04,194 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:30:04,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2022-07-13 03:30:04,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-07-13 03:30:04,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:04,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:04,195 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:04,195 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:04,196 INFO L752 eck$LassoCheckResult]: Stem: 125#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); 112#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_~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_~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;havoc main_~cond~0#1; 113#L127-1 [2022-07-13 03:30:04,196 INFO L754 eck$LassoCheckResult]: Loop: 113#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 140#L37 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; 138#L58 assume !(0 != main_~p1~0#1); 139#L58-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 157#L62-1 assume !(0 != main_~p3~0#1); 156#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 155#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 154#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 153#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 152#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 151#L86-1 assume !(0 != main_~p1~0#1); 109#L92-1 assume !(0 != main_~p2~0#1); 108#L97-1 assume !(0 != main_~p3~0#1); 123#L102-1 assume !(0 != main_~p4~0#1); 129#L107-1 assume !(0 != main_~p5~0#1); 143#L112-1 assume !(0 != main_~p6~0#1); 137#L117-1 assume !(0 != main_~p7~0#1); 131#L122-1 assume !(0 != main_~p8~0#1); 113#L127-1 [2022-07-13 03:30:04,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,196 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 03:30:04,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932733150] [2022-07-13 03:30:04,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,206 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:04,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,223 INFO L85 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2022-07-13 03:30:04,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487602465] [2022-07-13 03:30:04,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:04,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:04,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487602465] [2022-07-13 03:30:04,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487602465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:04,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:04,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:04,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932937] [2022-07-13 03:30:04,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:04,246 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:04,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:04,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:04,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:04,247 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:04,258 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2022-07-13 03:30:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:04,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2022-07-13 03:30:04,260 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2022-07-13 03:30:04,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2022-07-13 03:30:04,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2022-07-13 03:30:04,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2022-07-13 03:30:04,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2022-07-13 03:30:04,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:04,263 INFO L369 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-07-13 03:30:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2022-07-13 03:30:04,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-13 03:30:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 101 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2022-07-13 03:30:04,273 INFO L392 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-07-13 03:30:04,274 INFO L374 stractBuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2022-07-13 03:30:04,274 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:30:04,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2022-07-13 03:30:04,275 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2022-07-13 03:30:04,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:04,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:04,279 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:04,279 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:04,279 INFO L752 eck$LassoCheckResult]: Stem: 289#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); 273#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_~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_~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;havoc main_~cond~0#1; 274#L127-1 [2022-07-13 03:30:04,280 INFO L754 eck$LassoCheckResult]: Loop: 274#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 325#L37 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; 323#L58 assume !(0 != main_~p1~0#1); 320#L58-2 assume !(0 != main_~p2~0#1); 318#L62-1 assume !(0 != main_~p3~0#1); 316#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 314#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 312#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 310#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 308#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 306#L86-1 assume !(0 != main_~p1~0#1); 307#L92-1 assume !(0 != main_~p2~0#1); 348#L97-1 assume !(0 != main_~p3~0#1); 345#L102-1 assume !(0 != main_~p4~0#1); 341#L107-1 assume !(0 != main_~p5~0#1); 336#L112-1 assume !(0 != main_~p6~0#1); 333#L117-1 assume !(0 != main_~p7~0#1); 329#L122-1 assume !(0 != main_~p8~0#1); 274#L127-1 [2022-07-13 03:30:04,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,281 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-13 03:30:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612649754] [2022-07-13 03:30:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:04,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2022-07-13 03:30:04,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672321470] [2022-07-13 03:30:04,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:04,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:04,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672321470] [2022-07-13 03:30:04,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672321470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:04,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:04,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:04,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798789649] [2022-07-13 03:30:04,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:04,309 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:04,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:04,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:04,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:04,310 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:04,326 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2022-07-13 03:30:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:04,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2022-07-13 03:30:04,329 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2022-07-13 03:30:04,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2022-07-13 03:30:04,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2022-07-13 03:30:04,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2022-07-13 03:30:04,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2022-07-13 03:30:04,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:04,341 INFO L369 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-07-13 03:30:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2022-07-13 03:30:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-07-13 03:30:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 197 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2022-07-13 03:30:04,362 INFO L392 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-07-13 03:30:04,362 INFO L374 stractBuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2022-07-13 03:30:04,363 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:30:04,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2022-07-13 03:30:04,364 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2022-07-13 03:30:04,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:04,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:04,364 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:04,365 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:04,365 INFO L752 eck$LassoCheckResult]: Stem: 597#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); 580#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_~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_~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;havoc main_~cond~0#1; 581#L127-1 [2022-07-13 03:30:04,365 INFO L754 eck$LassoCheckResult]: Loop: 581#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 645#L37 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; 638#L58 assume !(0 != main_~p1~0#1); 639#L58-2 assume !(0 != main_~p2~0#1); 630#L62-1 assume !(0 != main_~p3~0#1); 631#L66-1 assume !(0 != main_~p4~0#1); 701#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 700#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 699#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 698#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 697#L86-1 assume !(0 != main_~p1~0#1); 694#L92-1 assume !(0 != main_~p2~0#1); 690#L97-1 assume !(0 != main_~p3~0#1); 688#L102-1 assume !(0 != main_~p4~0#1); 676#L107-1 assume !(0 != main_~p5~0#1); 675#L112-1 assume !(0 != main_~p6~0#1); 655#L117-1 assume !(0 != main_~p7~0#1); 654#L122-1 assume !(0 != main_~p8~0#1); 581#L127-1 [2022-07-13 03:30:04,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-13 03:30:04,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851966806] [2022-07-13 03:30:04,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:04,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2022-07-13 03:30:04,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076199634] [2022-07-13 03:30:04,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:04,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:04,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076199634] [2022-07-13 03:30:04,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076199634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:04,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:04,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:04,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532343282] [2022-07-13 03:30:04,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:04,414 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:04,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:04,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:04,416 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:04,440 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2022-07-13 03:30:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:04,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2022-07-13 03:30:04,443 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2022-07-13 03:30:04,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2022-07-13 03:30:04,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2022-07-13 03:30:04,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2022-07-13 03:30:04,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2022-07-13 03:30:04,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:04,447 INFO L369 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-07-13 03:30:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2022-07-13 03:30:04,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-07-13 03:30:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.4974093264248705) internal successors, (578), 385 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2022-07-13 03:30:04,458 INFO L392 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-07-13 03:30:04,458 INFO L374 stractBuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2022-07-13 03:30:04,458 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:30:04,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2022-07-13 03:30:04,460 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2022-07-13 03:30:04,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:04,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:04,461 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:04,461 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:04,461 INFO L752 eck$LassoCheckResult]: Stem: 1186#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); 1169#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_~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_~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;havoc main_~cond~0#1; 1170#L127-1 [2022-07-13 03:30:04,461 INFO L754 eck$LassoCheckResult]: Loop: 1170#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1273#L37 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; 1266#L58 assume !(0 != main_~p1~0#1); 1268#L58-2 assume !(0 != main_~p2~0#1); 1246#L62-1 assume !(0 != main_~p3~0#1); 1247#L66-1 assume !(0 != main_~p4~0#1); 1335#L70-1 assume !(0 != main_~p5~0#1); 1330#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1331#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1322#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1323#L86-1 assume !(0 != main_~p1~0#1); 1359#L92-1 assume !(0 != main_~p2~0#1); 1357#L97-1 assume !(0 != main_~p3~0#1); 1355#L102-1 assume !(0 != main_~p4~0#1); 1354#L107-1 assume !(0 != main_~p5~0#1); 1352#L112-1 assume !(0 != main_~p6~0#1); 1351#L117-1 assume !(0 != main_~p7~0#1); 1287#L122-1 assume !(0 != main_~p8~0#1); 1170#L127-1 [2022-07-13 03:30:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,462 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-13 03:30:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239094194] [2022-07-13 03:30:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,471 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:04,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2022-07-13 03:30:04,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670063995] [2022-07-13 03:30:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:04,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:04,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670063995] [2022-07-13 03:30:04,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670063995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:04,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:04,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:04,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865060149] [2022-07-13 03:30:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:04,491 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:04,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:04,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:04,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:04,492 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:04,503 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2022-07-13 03:30:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:04,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2022-07-13 03:30:04,509 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2022-07-13 03:30:04,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2022-07-13 03:30:04,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2022-07-13 03:30:04,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2022-07-13 03:30:04,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2022-07-13 03:30:04,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:04,536 INFO L369 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-07-13 03:30:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2022-07-13 03:30:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2022-07-13 03:30:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.46684350132626) internal successors, (1106), 753 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) [2022-07-13 03:30:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2022-07-13 03:30:04,551 INFO L392 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-07-13 03:30:04,551 INFO L374 stractBuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2022-07-13 03:30:04,551 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:30:04,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2022-07-13 03:30:04,554 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2022-07-13 03:30:04,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:04,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:04,555 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:04,555 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:04,555 INFO L752 eck$LassoCheckResult]: Stem: 2329#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); 2315#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_~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_~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;havoc main_~cond~0#1; 2316#L127-1 [2022-07-13 03:30:04,555 INFO L754 eck$LassoCheckResult]: Loop: 2316#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 2415#L37 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; 2411#L58 assume !(0 != main_~p1~0#1); 2408#L58-2 assume !(0 != main_~p2~0#1); 2406#L62-1 assume !(0 != main_~p3~0#1); 2403#L66-1 assume !(0 != main_~p4~0#1); 2399#L70-1 assume !(0 != main_~p5~0#1); 2396#L74-1 assume !(0 != main_~p6~0#1); 2394#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2391#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2387#L86-1 assume !(0 != main_~p1~0#1); 2385#L92-1 assume !(0 != main_~p2~0#1); 2381#L97-1 assume !(0 != main_~p3~0#1); 2378#L102-1 assume !(0 != main_~p4~0#1); 2379#L107-1 assume !(0 != main_~p5~0#1); 2426#L112-1 assume !(0 != main_~p6~0#1); 2423#L117-1 assume !(0 != main_~p7~0#1); 2420#L122-1 assume !(0 != main_~p8~0#1); 2316#L127-1 [2022-07-13 03:30:04,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,556 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-13 03:30:04,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505906648] [2022-07-13 03:30:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,560 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:04,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2022-07-13 03:30:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898565850] [2022-07-13 03:30:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:04,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:04,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898565850] [2022-07-13 03:30:04,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898565850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:04,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:04,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:04,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201288130] [2022-07-13 03:30:04,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:04,604 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:04,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:04,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:04,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:04,606 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:04,621 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2022-07-13 03:30:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:04,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2022-07-13 03:30:04,636 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2022-07-13 03:30:04,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2022-07-13 03:30:04,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2022-07-13 03:30:04,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2022-07-13 03:30:04,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2022-07-13 03:30:04,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:04,651 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-07-13 03:30:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2022-07-13 03:30:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2022-07-13 03:30:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1474 states have (on average 1.4341926729986432) internal successors, (2114), 1473 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2022-07-13 03:30:04,673 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-07-13 03:30:04,673 INFO L374 stractBuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2022-07-13 03:30:04,674 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:30:04,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2022-07-13 03:30:04,680 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2022-07-13 03:30:04,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:04,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:04,681 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:04,682 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:04,682 INFO L752 eck$LassoCheckResult]: Stem: 4564#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); 4550#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_~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_~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;havoc main_~cond~0#1; 4551#L127-1 [2022-07-13 03:30:04,682 INFO L754 eck$LassoCheckResult]: Loop: 4551#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 4806#L37 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; 4807#L58 assume !(0 != main_~p1~0#1); 4818#L58-2 assume !(0 != main_~p2~0#1); 4816#L62-1 assume !(0 != main_~p3~0#1); 4812#L66-1 assume !(0 != main_~p4~0#1); 4809#L70-1 assume !(0 != main_~p5~0#1); 4770#L74-1 assume !(0 != main_~p6~0#1); 4767#L78-1 assume !(0 != main_~p7~0#1); 4765#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4730#L86-1 assume !(0 != main_~p1~0#1); 4724#L92-1 assume !(0 != main_~p2~0#1); 4725#L97-1 assume !(0 != main_~p3~0#1); 4711#L102-1 assume !(0 != main_~p4~0#1); 4713#L107-1 assume !(0 != main_~p5~0#1); 4831#L112-1 assume !(0 != main_~p6~0#1); 4827#L117-1 assume !(0 != main_~p7~0#1); 4824#L122-1 assume !(0 != main_~p8~0#1); 4551#L127-1 [2022-07-13 03:30:04,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-07-13 03:30:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454879473] [2022-07-13 03:30:04,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,707 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:04,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2022-07-13 03:30:04,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072024855] [2022-07-13 03:30:04,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:04,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:04,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072024855] [2022-07-13 03:30:04,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072024855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:04,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:04,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:30:04,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674930603] [2022-07-13 03:30:04,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:04,743 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:04,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:04,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:04,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:04,743 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:04,779 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2022-07-13 03:30:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:04,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2022-07-13 03:30:04,793 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2022-07-13 03:30:04,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2022-07-13 03:30:04,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2022-07-13 03:30:04,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2022-07-13 03:30:04,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2022-07-13 03:30:04,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:04,810 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-07-13 03:30:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2022-07-13 03:30:04,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2022-07-13 03:30:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2882 states have (on average 1.3997224149895906) internal successors, (4034), 2881 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2022-07-13 03:30:04,863 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-07-13 03:30:04,863 INFO L374 stractBuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2022-07-13 03:30:04,863 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:30:04,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2022-07-13 03:30:04,874 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2022-07-13 03:30:04,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:04,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:04,875 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:04,875 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:04,876 INFO L752 eck$LassoCheckResult]: Stem: 8925#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); 8910#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_~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_~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;havoc main_~cond~0#1; 8911#L127-1 [2022-07-13 03:30:04,876 INFO L754 eck$LassoCheckResult]: Loop: 8911#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 9035#L37 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; 9033#L58 assume !(0 != main_~p1~0#1); 9027#L58-2 assume !(0 != main_~p2~0#1); 9029#L62-1 assume !(0 != main_~p3~0#1); 9017#L66-1 assume !(0 != main_~p4~0#1); 9019#L70-1 assume !(0 != main_~p5~0#1); 9005#L74-1 assume !(0 != main_~p6~0#1); 9007#L78-1 assume !(0 != main_~p7~0#1); 8993#L82-1 assume !(0 != main_~p8~0#1); 8995#L86-1 assume !(0 != main_~p1~0#1); 9058#L92-1 assume !(0 != main_~p2~0#1); 9056#L97-1 assume !(0 != main_~p3~0#1); 9053#L102-1 assume !(0 != main_~p4~0#1); 9051#L107-1 assume !(0 != main_~p5~0#1); 9047#L112-1 assume !(0 != main_~p6~0#1); 9043#L117-1 assume !(0 != main_~p7~0#1); 9039#L122-1 assume !(0 != main_~p8~0#1); 8911#L127-1 [2022-07-13 03:30:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-07-13 03:30:04,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127989318] [2022-07-13 03:30:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:04,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2022-07-13 03:30:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720057613] [2022-07-13 03:30:04,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2022-07-13 03:30:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307286952] [2022-07-13 03:30:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:05,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:30:05 BoogieIcfgContainer [2022-07-13 03:30:05,204 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:30:05,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:30:05,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:30:05,205 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:30:05,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:30:03" (3/4) ... [2022-07-13 03:30:05,209 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 03:30:05,238 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 03:30:05,238 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:30:05,238 INFO L158 Benchmark]: Toolchain (without parser) took 2027.87ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 59.0MB in the beginning and 43.3MB in the end (delta: 15.7MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:05,239 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:30:05,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.62ms. Allocated memory is still 94.4MB. Free memory was 58.8MB in the beginning and 70.7MB in the end (delta: -11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:30:05,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.57ms. Allocated memory is still 94.4MB. Free memory was 70.7MB in the beginning and 69.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:30:05,240 INFO L158 Benchmark]: Boogie Preprocessor took 33.86ms. Allocated memory is still 94.4MB. Free memory was 69.0MB in the beginning and 67.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:05,240 INFO L158 Benchmark]: RCFGBuilder took 295.36ms. Allocated memory is still 94.4MB. Free memory was 67.8MB in the beginning and 57.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:30:05,241 INFO L158 Benchmark]: BuchiAutomizer took 1389.23ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 57.1MB in the beginning and 46.1MB in the end (delta: 11.1MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2022-07-13 03:30:05,241 INFO L158 Benchmark]: Witness Printer took 32.87ms. Allocated memory is still 113.2MB. Free memory was 45.3MB in the beginning and 43.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:05,243 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 94.4MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.62ms. Allocated memory is still 94.4MB. Free memory was 58.8MB in the beginning and 70.7MB in the end (delta: -11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.57ms. Allocated memory is still 94.4MB. Free memory was 70.7MB in the beginning and 69.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.86ms. Allocated memory is still 94.4MB. Free memory was 69.0MB in the beginning and 67.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 295.36ms. Allocated memory is still 94.4MB. Free memory was 67.8MB in the beginning and 57.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1389.23ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 57.1MB in the beginning and 46.1MB in the end (delta: 11.1MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Witness Printer took 32.87ms. Allocated memory is still 113.2MB. Free memory was 45.3MB in the beginning and 43.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 459 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI7 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 35]: 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 {lk5=0, p1=0, NULL=0, NULL=1, cond=4, p5=0, lk2=0, p4=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9b64484=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@236b7dc2=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79c20f76=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60e65e51=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71e60de2=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f37c4d3=0, \result=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62c5e34c=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@714bad1d=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@300337cb=0, p2=0, lk4=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: 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; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-13 03:30:05,285 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)