./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 e19ca921 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-dev-e19ca92 [2021-12-22 19:59:00,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 19:59:00,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 19:59:00,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 19:59:00,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 19:59:00,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 19:59:00,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 19:59:00,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 19:59:00,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 19:59:00,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 19:59:00,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 19:59:00,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 19:59:00,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 19:59:00,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 19:59:00,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 19:59:00,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 19:59:00,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 19:59:00,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 19:59:00,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 19:59:00,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 19:59:00,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 19:59:00,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 19:59:00,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 19:59:00,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 19:59:00,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 19:59:00,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 19:59:00,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 19:59:00,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 19:59:00,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 19:59:00,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 19:59:00,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 19:59:00,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 19:59:00,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 19:59:00,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 19:59:00,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 19:59:00,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 19:59:00,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 19:59:00,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 19:59:00,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 19:59:00,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 19:59:00,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 19:59:00,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-22 19:59:00,952 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 19:59:00,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 19:59:00,952 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 19:59:00,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 19:59:00,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 19:59:00,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 19:59:00,954 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 19:59:00,954 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-22 19:59:00,954 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-22 19:59:00,954 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-22 19:59:00,955 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-22 19:59:00,955 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-22 19:59:00,968 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-22 19:59:00,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 19:59:00,969 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 19:59:00,969 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 19:59:00,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 19:59:00,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 19:59:00,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 19:59:00,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-22 19:59:00,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-22 19:59:00,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-22 19:59:00,970 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 19:59:00,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 19:59:00,971 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-22 19:59:00,971 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 19:59:00,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-22 19:59:00,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 19:59:00,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 19:59:00,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 19:59:00,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 19:59:00,972 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 19:59:00,973 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-22 19:59:00,973 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 [2021-12-22 19:59:01,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 19:59:01,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 19:59:01,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 19:59:01,229 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 19:59:01,229 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 19:59:01,230 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c [2021-12-22 19:59:01,285 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29a36836/139af73d732a4c64a4dae145fbda9b38/FLAGbababe275 [2021-12-22 19:59:01,742 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 19:59:01,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2021-12-22 19:59:01,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29a36836/139af73d732a4c64a4dae145fbda9b38/FLAGbababe275 [2021-12-22 19:59:02,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29a36836/139af73d732a4c64a4dae145fbda9b38 [2021-12-22 19:59:02,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 19:59:02,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 19:59:02,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 19:59:02,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 19:59:02,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 19:59:02,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a322ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02, skipping insertion in model container [2021-12-22 19:59:02,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 19:59:02,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 19:59:02,414 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] [2021-12-22 19:59:02,415 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 19:59:02,422 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 19:59:02,436 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] [2021-12-22 19:59:02,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 19:59:02,448 INFO L208 MainTranslator]: Completed translation [2021-12-22 19:59:02,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02 WrapperNode [2021-12-22 19:59:02,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 19:59:02,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 19:59:02,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 19:59:02,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 19:59:02,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,480 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2021-12-22 19:59:02,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 19:59:02,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 19:59:02,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 19:59:02,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 19:59:02,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 19:59:02,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 19:59:02,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 19:59:02,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 19:59:02,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02" (1/1) ... [2021-12-22 19:59:02,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:59:02,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:59:02,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:59:02,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-22 19:59:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 19:59:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 19:59:02,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 19:59:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 19:59:02,619 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 19:59:02,621 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 19:59:02,773 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 19:59:02,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 19:59:02,797 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-22 19:59:02,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:59:02 BoogieIcfgContainer [2021-12-22 19:59:02,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 19:59:02,800 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-22 19:59:02,800 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-22 19:59:02,803 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-22 19:59:02,803 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:59:02,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 07:59:02" (1/3) ... [2021-12-22 19:59:02,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b61be1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:59:02, skipping insertion in model container [2021-12-22 19:59:02,805 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:59:02,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:59:02" (2/3) ... [2021-12-22 19:59:02,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b61be1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:59:02, skipping insertion in model container [2021-12-22 19:59:02,805 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:59:02,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:59:02" (3/3) ... [2021-12-22 19:59:02,807 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_5.c [2021-12-22 19:59:02,839 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-22 19:59:02,840 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-22 19:59:02,840 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-22 19:59:02,840 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-22 19:59:02,840 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-22 19:59:02,840 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-22 19:59:02,840 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-22 19:59:02,840 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-22 19:59:02,851 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) [2021-12-22 19:59:02,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-12-22 19:59:02,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:59:02,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:59:02,869 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:59:02,869 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:59:02,870 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-22 19:59:02,870 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) [2021-12-22 19:59:02,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-12-22 19:59:02,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:59:02,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:59:02,873 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:59:02,873 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:59:02,878 INFO L791 eck$LassoCheckResult]: Stem: 6#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); 14#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; 8#L85-1true [2021-12-22 19:59:02,879 INFO L793 eck$LassoCheckResult]: Loop: 8#L85-1true assume !false;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 23#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; 9#L43true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 10#L43-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 19#L47-1true assume !(0 != main_~p3~0#1); 17#L51-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 18#L55-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 21#L59-1true assume !(0 != main_~p1~0#1); 11#L65-1true assume !(0 != main_~p2~0#1); 20#L70-1true assume !(0 != main_~p3~0#1); 22#L75-1true assume !(0 != main_~p4~0#1); 24#L80-1true assume !(0 != main_~p5~0#1); 8#L85-1true [2021-12-22 19:59:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:59:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-22 19:59:02,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:59:02,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115553405] [2021-12-22 19:59:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:59:02,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:59:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:02,977 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:59:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,016 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:59:03,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:59:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2089480461, now seen corresponding path program 1 times [2021-12-22 19:59:03,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:59:03,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933743961] [2021-12-22 19:59:03,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:59:03,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:59:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:59:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:59:03,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:59:03,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933743961] [2021-12-22 19:59:03,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933743961] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:59:03,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:59:03,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 19:59:03,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278746803] [2021-12-22 19:59:03,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:59:03,110 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 19:59:03,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:59:03,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 19:59:03,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 19:59:03,146 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) [2021-12-22 19:59:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:59:03,177 INFO L93 Difference]: Finished difference Result 45 states and 70 transitions. [2021-12-22 19:59:03,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 19:59:03,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 70 transitions. [2021-12-22 19:59:03,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2021-12-22 19:59:03,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 35 states and 53 transitions. [2021-12-22 19:59:03,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-12-22 19:59:03,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-12-22 19:59:03,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 53 transitions. [2021-12-22 19:59:03,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:59:03,197 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 53 transitions. [2021-12-22 19:59:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 53 transitions. [2021-12-22 19:59:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-12-22 19:59:03,221 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) [2021-12-22 19:59:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2021-12-22 19:59:03,223 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 53 transitions. [2021-12-22 19:59:03,223 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 53 transitions. [2021-12-22 19:59:03,224 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-22 19:59:03,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 53 transitions. [2021-12-22 19:59:03,227 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2021-12-22 19:59:03,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:59:03,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:59:03,228 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:59:03,228 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:59:03,228 INFO L791 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 [2021-12-22 19:59:03,228 INFO L793 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 [2021-12-22 19:59:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:59:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-22 19:59:03,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:59:03,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366611467] [2021-12-22 19:59:03,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:59:03,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:59:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,255 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:59:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,260 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:59:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:59:03,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1812459825, now seen corresponding path program 1 times [2021-12-22 19:59:03,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:59:03,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963375251] [2021-12-22 19:59:03,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:59:03,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:59:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:59:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:59:03,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:59:03,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963375251] [2021-12-22 19:59:03,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963375251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:59:03,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:59:03,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 19:59:03,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460198313] [2021-12-22 19:59:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:59:03,314 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 19:59:03,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:59:03,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 19:59:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 19:59:03,317 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) [2021-12-22 19:59:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:59:03,334 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2021-12-22 19:59:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 19:59:03,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 98 transitions. [2021-12-22 19:59:03,338 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2021-12-22 19:59:03,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 98 transitions. [2021-12-22 19:59:03,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2021-12-22 19:59:03,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2021-12-22 19:59:03,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 98 transitions. [2021-12-22 19:59:03,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:59:03,342 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 98 transitions. [2021-12-22 19:59:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 98 transitions. [2021-12-22 19:59:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-12-22 19:59:03,349 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) [2021-12-22 19:59:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2021-12-22 19:59:03,352 INFO L704 BuchiCegarLoop]: Abstraction has 66 states and 98 transitions. [2021-12-22 19:59:03,352 INFO L587 BuchiCegarLoop]: Abstraction has 66 states and 98 transitions. [2021-12-22 19:59:03,352 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-22 19:59:03,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 98 transitions. [2021-12-22 19:59:03,355 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2021-12-22 19:59:03,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:59:03,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:59:03,357 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:59:03,357 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:59:03,358 INFO L791 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 [2021-12-22 19:59:03,358 INFO L793 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 [2021-12-22 19:59:03,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:59:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-22 19:59:03,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:59:03,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147839707] [2021-12-22 19:59:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:59:03,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:59:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:59:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,381 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:59:03,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:59:03,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1802449101, now seen corresponding path program 1 times [2021-12-22 19:59:03,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:59:03,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796699763] [2021-12-22 19:59:03,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:59:03,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:59:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:59:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:59:03,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:59:03,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796699763] [2021-12-22 19:59:03,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796699763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:59:03,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:59:03,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 19:59:03,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252343982] [2021-12-22 19:59:03,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:59:03,415 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 19:59:03,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:59:03,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 19:59:03,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 19:59:03,417 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) [2021-12-22 19:59:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:59:03,439 INFO L93 Difference]: Finished difference Result 126 states and 182 transitions. [2021-12-22 19:59:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 19:59:03,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 182 transitions. [2021-12-22 19:59:03,442 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2021-12-22 19:59:03,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 182 transitions. [2021-12-22 19:59:03,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-12-22 19:59:03,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-12-22 19:59:03,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 182 transitions. [2021-12-22 19:59:03,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:59:03,449 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 182 transitions. [2021-12-22 19:59:03,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 182 transitions. [2021-12-22 19:59:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-22 19:59:03,457 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) [2021-12-22 19:59:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2021-12-22 19:59:03,461 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 182 transitions. [2021-12-22 19:59:03,461 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 182 transitions. [2021-12-22 19:59:03,461 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-22 19:59:03,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 182 transitions. [2021-12-22 19:59:03,462 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2021-12-22 19:59:03,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:59:03,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:59:03,464 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:59:03,464 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:59:03,464 INFO L791 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 [2021-12-22 19:59:03,465 INFO L793 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 [2021-12-22 19:59:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:59:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-22 19:59:03,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:59:03,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684819346] [2021-12-22 19:59:03,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:59:03,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:59:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,479 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:59:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,484 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:59:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:59:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash -27441739, now seen corresponding path program 1 times [2021-12-22 19:59:03,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:59:03,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125904070] [2021-12-22 19:59:03,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:59:03,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:59:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:59:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:59:03,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:59:03,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125904070] [2021-12-22 19:59:03,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125904070] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:59:03,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:59:03,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 19:59:03,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886502401] [2021-12-22 19:59:03,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:59:03,512 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 19:59:03,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:59:03,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 19:59:03,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 19:59:03,514 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) [2021-12-22 19:59:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:59:03,540 INFO L93 Difference]: Finished difference Result 242 states and 338 transitions. [2021-12-22 19:59:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 19:59:03,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 338 transitions. [2021-12-22 19:59:03,543 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2021-12-22 19:59:03,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 242 states and 338 transitions. [2021-12-22 19:59:03,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2021-12-22 19:59:03,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2021-12-22 19:59:03,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 338 transitions. [2021-12-22 19:59:03,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:59:03,551 INFO L681 BuchiCegarLoop]: Abstraction has 242 states and 338 transitions. [2021-12-22 19:59:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 338 transitions. [2021-12-22 19:59:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-12-22 19:59:03,564 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) [2021-12-22 19:59:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 338 transitions. [2021-12-22 19:59:03,566 INFO L704 BuchiCegarLoop]: Abstraction has 242 states and 338 transitions. [2021-12-22 19:59:03,566 INFO L587 BuchiCegarLoop]: Abstraction has 242 states and 338 transitions. [2021-12-22 19:59:03,566 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-22 19:59:03,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 338 transitions. [2021-12-22 19:59:03,567 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2021-12-22 19:59:03,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:59:03,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:59:03,568 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:59:03,568 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 19:59:03,569 INFO L791 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 [2021-12-22 19:59:03,569 INFO L793 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 [2021-12-22 19:59:03,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:59:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-22 19:59:03,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:59:03,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882576679] [2021-12-22 19:59:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:59:03,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:59:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,579 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:59:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,590 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:59:03,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:59:03,591 INFO L85 PathProgramCache]: Analyzing trace with hash 29816563, now seen corresponding path program 1 times [2021-12-22 19:59:03,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:59:03,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914013436] [2021-12-22 19:59:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:59:03,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:59:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:59:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,616 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:59:03,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:59:03,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1243965365, now seen corresponding path program 1 times [2021-12-22 19:59:03,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:59:03,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401057488] [2021-12-22 19:59:03,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:59:03,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:59:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:59:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:59:03,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:59:03,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.12 07:59:03 BoogieIcfgContainer [2021-12-22 19:59:03,876 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-22 19:59:03,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 19:59:03,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 19:59:03,877 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 19:59:03,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:59:02" (3/4) ... [2021-12-22 19:59:03,879 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-22 19:59:03,907 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 19:59:03,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 19:59:03,908 INFO L158 Benchmark]: Toolchain (without parser) took 1621.40ms. Allocated memory is still 113.2MB. Free memory was 91.7MB in the beginning and 54.6MB in the end (delta: 37.1MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2021-12-22 19:59:03,908 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 60.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 19:59:03,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.46ms. Allocated memory is still 113.2MB. Free memory was 91.7MB in the beginning and 82.0MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 19:59:03,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.79ms. Allocated memory is still 113.2MB. Free memory was 82.0MB in the beginning and 80.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 19:59:03,909 INFO L158 Benchmark]: Boogie Preprocessor took 27.48ms. Allocated memory is still 113.2MB. Free memory was 80.4MB in the beginning and 79.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 19:59:03,909 INFO L158 Benchmark]: RCFGBuilder took 289.56ms. Allocated memory is still 113.2MB. Free memory was 79.2MB in the beginning and 69.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 19:59:03,910 INFO L158 Benchmark]: BuchiAutomizer took 1076.43ms. Allocated memory is still 113.2MB. Free memory was 69.0MB in the beginning and 56.7MB in the end (delta: 12.4MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2021-12-22 19:59:03,910 INFO L158 Benchmark]: Witness Printer took 30.82ms. Allocated memory is still 113.2MB. Free memory was 56.7MB in the beginning and 54.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 19:59:03,912 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 83.9MB. Free memory is still 60.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.46ms. Allocated memory is still 113.2MB. Free memory was 91.7MB in the beginning and 82.0MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.79ms. Allocated memory is still 113.2MB. Free memory was 82.0MB in the beginning and 80.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.48ms. Allocated memory is still 113.2MB. Free memory was 80.4MB in the beginning and 79.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 289.56ms. Allocated memory is still 113.2MB. Free memory was 79.2MB in the beginning and 69.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1076.43ms. Allocated memory is still 113.2MB. Free memory was 69.0MB in the beginning and 56.7MB in the end (delta: 12.4MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Witness Printer took 30.82ms. Allocated memory is still 113.2MB. Free memory was 56.7MB in the beginning and 54.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 1.0s and 5 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 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 242 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 277 SdHoareTripleChecker+Invalid, 0.0s 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 - 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@11527226=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13aa6a2=0, lk5=0, p1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27d1d780=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10acef8f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ac9b07a=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@730a7a6e=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! [2021-12-22 19:59:03,955 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)