./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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_5.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 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:11:00,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:11:00,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:11:00,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:11:00,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:11:00,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:11:00,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:11:00,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:11:00,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:11:00,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:11:00,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:11:00,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:11:00,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:11:00,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:11:00,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:11:00,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:11:00,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:11:00,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:11:00,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:11:00,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:11:00,423 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:11:00,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:11:00,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:11:00,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:11:00,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:11:00,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:11:00,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:11:00,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:11:00,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:11:00,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:11:00,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:11:00,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:11:00,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:11:00,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:11:00,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:11:00,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:11:00,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:11:00,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:11:00,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:11:00,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:11:00,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:11:00,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:11:00,441 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:11:00,472 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:11:00,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:11:00,473 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:11:00,473 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:11:00,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:11:00,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:11:00,475 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:11:00,475 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:11:00,475 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:11:00,476 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:11:00,476 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:11:00,477 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:11:00,477 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:11:00,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:11:00,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:11:00,477 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:11:00,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:11:00,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:11:00,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:11:00,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:11:00,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:11:00,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:11:00,479 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:11:00,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:11:00,479 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:11:00,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:11:00,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:11:00,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:11:00,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:11:00,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:11:00,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:11:00,481 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:11:00,481 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 -> 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 [2022-07-14 15:11:00,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:11:00,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:11:00,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:11:00,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:11:00,733 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:11:00,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c [2022-07-14 15:11:00,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c36844c7/119781df1a8b4930967f9010cc1a6f2a/FLAG1e0778b82 [2022-07-14 15:11:01,141 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:11:01,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2022-07-14 15:11:01,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c36844c7/119781df1a8b4930967f9010cc1a6f2a/FLAG1e0778b82 [2022-07-14 15:11:01,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c36844c7/119781df1a8b4930967f9010cc1a6f2a [2022-07-14 15:11:01,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:11:01,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:11:01,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:11:01,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:11:01,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:11:01,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d89ed23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01, skipping insertion in model container [2022-07-14 15:11:01,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:11:01,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:11:01,343 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_5.c[2207,2220] [2022-07-14 15:11:01,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:11:01,353 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:11:01,376 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_5.c[2207,2220] [2022-07-14 15:11:01,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:11:01,388 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:11:01,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01 WrapperNode [2022-07-14 15:11:01,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:11:01,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:11:01,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:11:01,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:11:01,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,416 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-07-14 15:11:01,416 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:11:01,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:11:01,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:11:01,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:11:01,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:11:01,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:11:01,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:11:01,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:11:01,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01" (1/1) ... [2022-07-14 15:11:01,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:11:01,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:11:01,480 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-14 15:11:01,505 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-14 15:11:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:11:01,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:11:01,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:11:01,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:11:01,577 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:11:01,579 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:11:01,665 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:11:01,671 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:11:01,671 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 15:11:01,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:11:01 BoogieIcfgContainer [2022-07-14 15:11:01,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:11:01,674 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:11:01,674 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:11:01,684 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:11:01,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:11:01,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:11:01" (1/3) ... [2022-07-14 15:11:01,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36608909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:11:01, skipping insertion in model container [2022-07-14 15:11:01,686 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:11:01,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:11:01" (2/3) ... [2022-07-14 15:11:01,687 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36608909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:11:01, skipping insertion in model container [2022-07-14 15:11:01,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:11:01,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:11:01" (3/3) ... [2022-07-14 15:11:01,688 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_5.c [2022-07-14 15:11:01,767 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:11:01,783 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:11:01,783 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:11:01,783 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:11:01,784 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:11:01,784 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:11:01,784 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:11:01,784 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:11:01,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 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-14 15:11:01,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-07-14 15:11:01,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:01,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:01,815 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:01,815 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:01,816 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:11:01,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 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-14 15:11:01,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-07-14 15:11:01,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:01,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:01,823 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:01,823 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:01,828 INFO L752 eck$LassoCheckResult]: Stem: 5#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); 13#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_~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_~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;havoc main_~cond~0#1; 7#L85-1true [2022-07-14 15:11:01,830 INFO L754 eck$LassoCheckResult]: Loop: 7#L85-1true assume !false;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 22#L28true 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; 8#L43true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 9#L43-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 18#L47-1true assume !(0 != main_~p3~0#1); 16#L51-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 17#L55-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 20#L59-1true assume !(0 != main_~p1~0#1); 10#L65-1true assume !(0 != main_~p2~0#1); 19#L70-1true assume !(0 != main_~p3~0#1); 21#L75-1true assume !(0 != main_~p4~0#1); 23#L80-1true assume !(0 != main_~p5~0#1); 7#L85-1true [2022-07-14 15:11:01,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:01,841 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:11:01,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:01,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311082665] [2022-07-14 15:11:01,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:01,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:01,937 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:01,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2089480461, now seen corresponding path program 1 times [2022-07-14 15:11:01,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:01,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988744803] [2022-07-14 15:11:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:01,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:02,062 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-14 15:11:02,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:02,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988744803] [2022-07-14 15:11:02,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988744803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:02,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:02,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:02,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835540883] [2022-07-14 15:11:02,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:02,068 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:02,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:02,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:02,100 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 15:11:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:02,147 INFO L93 Difference]: Finished difference Result 45 states and 70 transitions. [2022-07-14 15:11:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:02,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 70 transitions. [2022-07-14 15:11:02,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2022-07-14 15:11:02,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 35 states and 53 transitions. [2022-07-14 15:11:02,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-14 15:11:02,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-07-14 15:11:02,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 53 transitions. [2022-07-14 15:11:02,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:02,163 INFO L369 hiAutomatonCegarLoop]: Abstraction has 35 states and 53 transitions. [2022-07-14 15:11:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 53 transitions. [2022-07-14 15:11:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-14 15:11:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 34 states have internal predecessors, (53), 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-14 15:11:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2022-07-14 15:11:02,189 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 53 transitions. [2022-07-14 15:11:02,189 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 53 transitions. [2022-07-14 15:11:02,190 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:11:02,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 53 transitions. [2022-07-14 15:11:02,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2022-07-14 15:11:02,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:02,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:02,194 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:02,194 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:02,194 INFO L752 eck$LassoCheckResult]: Stem: 80#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); 81#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_~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_~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;havoc main_~cond~0#1; 79#L85-1 [2022-07-14 15:11:02,195 INFO L754 eck$LassoCheckResult]: Loop: 79#L85-1 assume !false;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 84#L28 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; 100#L43 assume !(0 != main_~p1~0#1); 87#L43-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 88#L47-1 assume !(0 != main_~p3~0#1); 93#L51-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 94#L55-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 95#L59-1 assume !(0 != main_~p1~0#1); 101#L65-1 assume !(0 != main_~p2~0#1); 111#L70-1 assume !(0 != main_~p3~0#1); 98#L75-1 assume !(0 != main_~p4~0#1); 92#L80-1 assume !(0 != main_~p5~0#1); 79#L85-1 [2022-07-14 15:11:02,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,196 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-14 15:11:02,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140419669] [2022-07-14 15:11:02,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,211 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:02,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1812459825, now seen corresponding path program 1 times [2022-07-14 15:11:02,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962035870] [2022-07-14 15:11:02,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:02,292 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-14 15:11:02,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:02,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962035870] [2022-07-14 15:11:02,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962035870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:02,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:02,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:02,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959217530] [2022-07-14 15:11:02,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:02,295 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:02,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:02,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:02,298 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 15:11:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:02,319 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2022-07-14 15:11:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:02,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 98 transitions. [2022-07-14 15:11:02,322 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2022-07-14 15:11:02,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 98 transitions. [2022-07-14 15:11:02,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-14 15:11:02,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-14 15:11:02,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 98 transitions. [2022-07-14 15:11:02,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:02,324 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2022-07-14 15:11:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 98 transitions. [2022-07-14 15:11:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-14 15:11:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 65 states have internal predecessors, (98), 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-14 15:11:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2022-07-14 15:11:02,329 INFO L392 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2022-07-14 15:11:02,329 INFO L374 stractBuchiCegarLoop]: Abstraction has 66 states and 98 transitions. [2022-07-14 15:11:02,329 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:11:02,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 98 transitions. [2022-07-14 15:11:02,330 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2022-07-14 15:11:02,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:02,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:02,331 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:02,331 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:02,331 INFO L752 eck$LassoCheckResult]: Stem: 189#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); 190#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_~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_~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;havoc main_~cond~0#1; 200#L85-1 [2022-07-14 15:11:02,331 INFO L754 eck$LassoCheckResult]: Loop: 200#L85-1 assume !false;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 224#L28 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; 222#L43 assume !(0 != main_~p1~0#1); 219#L43-2 assume !(0 != main_~p2~0#1); 217#L47-1 assume !(0 != main_~p3~0#1); 215#L51-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 214#L55-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 212#L59-1 assume !(0 != main_~p1~0#1); 213#L65-1 assume !(0 != main_~p2~0#1); 235#L70-1 assume !(0 != main_~p3~0#1); 231#L75-1 assume !(0 != main_~p4~0#1); 228#L80-1 assume !(0 != main_~p5~0#1); 200#L85-1 [2022-07-14 15:11:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-14 15:11:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035156175] [2022-07-14 15:11:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,340 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:02,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1802449101, now seen corresponding path program 1 times [2022-07-14 15:11:02,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874525629] [2022-07-14 15:11:02,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:02,362 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-14 15:11:02,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:02,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874525629] [2022-07-14 15:11:02,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874525629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:02,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:02,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549109414] [2022-07-14 15:11:02,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:02,363 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:02,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:02,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:02,364 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 15:11:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:02,377 INFO L93 Difference]: Finished difference Result 126 states and 182 transitions. [2022-07-14 15:11:02,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:02,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 182 transitions. [2022-07-14 15:11:02,380 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2022-07-14 15:11:02,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 182 transitions. [2022-07-14 15:11:02,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-07-14 15:11:02,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-07-14 15:11:02,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 182 transitions. [2022-07-14 15:11:02,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:02,384 INFO L369 hiAutomatonCegarLoop]: Abstraction has 126 states and 182 transitions. [2022-07-14 15:11:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 182 transitions. [2022-07-14 15:11:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-14 15:11:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 125 states have internal predecessors, (182), 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-14 15:11:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2022-07-14 15:11:02,393 INFO L392 hiAutomatonCegarLoop]: Abstraction has 126 states and 182 transitions. [2022-07-14 15:11:02,393 INFO L374 stractBuchiCegarLoop]: Abstraction has 126 states and 182 transitions. [2022-07-14 15:11:02,393 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:11:02,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 182 transitions. [2022-07-14 15:11:02,394 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2022-07-14 15:11:02,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:02,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:02,395 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:02,395 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:02,395 INFO L752 eck$LassoCheckResult]: Stem: 385#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); 386#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_~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_~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;havoc main_~cond~0#1; 400#L85-1 [2022-07-14 15:11:02,395 INFO L754 eck$LassoCheckResult]: Loop: 400#L85-1 assume !false;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 435#L28 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; 431#L43 assume !(0 != main_~p1~0#1); 428#L43-2 assume !(0 != main_~p2~0#1); 426#L47-1 assume !(0 != main_~p3~0#1); 425#L51-1 assume !(0 != main_~p4~0#1); 421#L55-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 422#L59-1 assume !(0 != main_~p1~0#1); 447#L65-1 assume !(0 != main_~p2~0#1); 445#L70-1 assume !(0 != main_~p3~0#1); 442#L75-1 assume !(0 != main_~p4~0#1); 439#L80-1 assume !(0 != main_~p5~0#1); 400#L85-1 [2022-07-14 15:11:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-14 15:11:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672796072] [2022-07-14 15:11:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:02,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,406 INFO L85 PathProgramCache]: Analyzing trace with hash -27441739, now seen corresponding path program 1 times [2022-07-14 15:11:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252238474] [2022-07-14 15:11:02,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:02,421 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-14 15:11:02,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:02,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252238474] [2022-07-14 15:11:02,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252238474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:02,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:02,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:11:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504131285] [2022-07-14 15:11:02,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:02,423 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:02,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:02,424 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. cyclomatic complexity: 64 Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 15:11:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:02,446 INFO L93 Difference]: Finished difference Result 242 states and 338 transitions. [2022-07-14 15:11:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:02,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 338 transitions. [2022-07-14 15:11:02,450 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2022-07-14 15:11:02,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 242 states and 338 transitions. [2022-07-14 15:11:02,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2022-07-14 15:11:02,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2022-07-14 15:11:02,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 338 transitions. [2022-07-14 15:11:02,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:02,454 INFO L369 hiAutomatonCegarLoop]: Abstraction has 242 states and 338 transitions. [2022-07-14 15:11:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 338 transitions. [2022-07-14 15:11:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-07-14 15:11:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 242 states have (on average 1.396694214876033) internal successors, (338), 241 states have internal predecessors, (338), 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-14 15:11:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 338 transitions. [2022-07-14 15:11:02,470 INFO L392 hiAutomatonCegarLoop]: Abstraction has 242 states and 338 transitions. [2022-07-14 15:11:02,470 INFO L374 stractBuchiCegarLoop]: Abstraction has 242 states and 338 transitions. [2022-07-14 15:11:02,470 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:11:02,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 338 transitions. [2022-07-14 15:11:02,472 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2022-07-14 15:11:02,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:02,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:02,472 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:02,472 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:02,472 INFO L752 eck$LassoCheckResult]: Stem: 759#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); 760#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_~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_~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;havoc main_~cond~0#1; 773#L85-1 [2022-07-14 15:11:02,473 INFO L754 eck$LassoCheckResult]: Loop: 773#L85-1 assume !false;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 836#L28 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; 833#L43 assume !(0 != main_~p1~0#1); 829#L43-2 assume !(0 != main_~p2~0#1); 826#L47-1 assume !(0 != main_~p3~0#1); 820#L51-1 assume !(0 != main_~p4~0#1); 795#L55-1 assume !(0 != main_~p5~0#1); 796#L59-1 assume !(0 != main_~p1~0#1); 853#L65-1 assume !(0 != main_~p2~0#1); 842#L70-1 assume !(0 != main_~p3~0#1); 821#L75-1 assume !(0 != main_~p4~0#1); 823#L80-1 assume !(0 != main_~p5~0#1); 773#L85-1 [2022-07-14 15:11:02,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,473 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-14 15:11:02,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384274174] [2022-07-14 15:11:02,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,478 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash 29816563, now seen corresponding path program 1 times [2022-07-14 15:11:02,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125900114] [2022-07-14 15:11:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,488 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1243965365, now seen corresponding path program 1 times [2022-07-14 15:11:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652796267] [2022-07-14 15:11:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:02,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:11:02 BoogieIcfgContainer [2022-07-14 15:11:02,687 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:11:02,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:11:02,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:11:02,688 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:11:02,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:11:01" (3/4) ... [2022-07-14 15:11:02,690 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-14 15:11:02,733 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 15:11:02,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:11:02,734 INFO L158 Benchmark]: Toolchain (without parser) took 1574.97ms. Allocated memory is still 98.6MB. Free memory was 62.2MB in the beginning and 41.5MB in the end (delta: 20.7MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-07-14 15:11:02,734 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory was 78.7MB in the beginning and 78.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:11:02,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.14ms. Allocated memory is still 98.6MB. Free memory was 62.0MB in the beginning and 74.8MB in the end (delta: -12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 15:11:02,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.82ms. Allocated memory is still 98.6MB. Free memory was 74.8MB in the beginning and 73.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:11:02,736 INFO L158 Benchmark]: Boogie Preprocessor took 21.22ms. Allocated memory is still 98.6MB. Free memory was 73.0MB in the beginning and 72.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:11:02,736 INFO L158 Benchmark]: RCFGBuilder took 234.92ms. Allocated memory is still 98.6MB. Free memory was 72.0MB in the beginning and 62.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 15:11:02,737 INFO L158 Benchmark]: BuchiAutomizer took 1012.72ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 43.0MB in the end (delta: 19.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2022-07-14 15:11:02,737 INFO L158 Benchmark]: Witness Printer took 45.76ms. Allocated memory is still 98.6MB. Free memory was 43.0MB in the beginning and 41.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:11:02,741 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.17ms. Allocated memory is still 98.6MB. Free memory was 78.7MB in the beginning and 78.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.14ms. Allocated memory is still 98.6MB. Free memory was 62.0MB in the beginning and 74.8MB in the end (delta: -12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.82ms. Allocated memory is still 98.6MB. Free memory was 74.8MB in the beginning and 73.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.22ms. Allocated memory is still 98.6MB. Free memory was 73.0MB in the beginning and 72.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 234.92ms. Allocated memory is still 98.6MB. Free memory was 72.0MB in the beginning and 62.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1012.72ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 43.0MB in the end (delta: 19.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 45.76ms. Allocated memory is still 98.6MB. Free memory was 43.0MB in the beginning and 41.5MB in the end (delta: 1.5MB). 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 242 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s 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, 89 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 277 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 177 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 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: 26]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a623ca8=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38aefb73=0, lk5=0, p1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f5269c8=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3edaa0e8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b0b72c=0, NULL=1, \result=0, cond=4, p5=0, p4=0, lk2=0, NULL=0, lk4=0, p2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70687832=4, lk1=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 26]: 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; [L24] int cond; Loop: [L26] COND TRUE 1 [L27] cond = __VERIFIER_nondet_int() [L28] COND FALSE !(cond == 0) [L31] lk1 = 0 [L33] lk2 = 0 [L35] lk3 = 0 [L37] lk4 = 0 [L39] lk5 = 0 [L43] COND FALSE !(p1 != 0) [L47] COND FALSE !(p2 != 0) [L51] COND FALSE !(p3 != 0) [L55] COND FALSE !(p4 != 0) [L59] COND FALSE !(p5 != 0) [L65] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L75] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L85] COND FALSE !(p5 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-14 15:11:02,779 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)