./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-pthread/cs_lazy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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/seq-pthread/cs_lazy.i -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 1c98d2b42571c22f220fbb32e85a6b327eeea301 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 17:31:07,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:31:07,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:31:07,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:31:07,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:31:07,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:31:07,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:31:07,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:31:07,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:31:07,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:31:07,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:31:07,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:31:07,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:31:07,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:31:07,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:31:07,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:31:07,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:31:07,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:31:07,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:31:07,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:31:07,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:31:07,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:31:07,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:31:07,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:31:07,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:31:07,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:31:07,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:31:07,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:31:07,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:31:08,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:31:08,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:31:08,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:31:08,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:31:08,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:31:08,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:31:08,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:31:08,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:31:08,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:31:08,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:31:08,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:31:08,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:31:08,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:31:08,048 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:31:08,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:31:08,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:31:08,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:31:08,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:31:08,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:31:08,051 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:31:08,052 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:31:08,052 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:31:08,052 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:31:08,053 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:31:08,053 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:31:08,053 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:31:08,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:31:08,054 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:31:08,054 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:31:08,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:31:08,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:31:08,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:31:08,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:31:08,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:31:08,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:31:08,055 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:31:08,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:31:08,055 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:31:08,056 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:31:08,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:31:08,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:31:08,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:31:08,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:31:08,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:31:08,057 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:31:08,058 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:31:08,058 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 -> 1c98d2b42571c22f220fbb32e85a6b327eeea301 [2021-08-27 17:31:08,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:31:08,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:31:08,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:31:08,410 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:31:08,410 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:31:08,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2021-08-27 17:31:08,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb23e892/b3fa6c5f657c4bb1823430e19e9318b2/FLAGf7b54f972 [2021-08-27 17:31:08,937 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:31:08,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2021-08-27 17:31:08,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb23e892/b3fa6c5f657c4bb1823430e19e9318b2/FLAGf7b54f972 [2021-08-27 17:31:09,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb23e892/b3fa6c5f657c4bb1823430e19e9318b2 [2021-08-27 17:31:09,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:31:09,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:31:09,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:31:09,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:31:09,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:31:09,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:09,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ccd973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09, skipping insertion in model container [2021-08-27 17:31:09,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:09,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:31:09,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:31:09,632 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2021-08-27 17:31:09,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:31:09,769 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:31:09,791 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2021-08-27 17:31:09,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:31:09,852 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:31:09,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09 WrapperNode [2021-08-27 17:31:09,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:31:09,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:31:09,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:31:09,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:31:09,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:09,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:10,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:31:10,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:31:10,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:31:10,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:31:10,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:10,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:10,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:10,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:10,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:10,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:10,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:10,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:31:10,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:31:10,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:31:10,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:31:10,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09" (1/1) ... [2021-08-27 17:31:10,169 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:31:10,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:31:10,189 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-08-27 17:31:10,220 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-08-27 17:31:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 17:31:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 17:31:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 17:31:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:31:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 17:31:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:31:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 17:31:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:31:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:31:10,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:31:10,602 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 17:31:10,603 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 17:31:10,618 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 17:31:10,618 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 17:31:10,631 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 17:31:10,632 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 17:31:10,639 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 17:31:10,640 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 17:31:25,283 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##686: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,283 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,283 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##693: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,283 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##692: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,284 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,284 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume !(0 != ~__CS_ret~0 % 256); [2021-08-27 17:31:25,284 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,284 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5; [2021-08-27 17:31:25,284 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-13: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,284 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-13: assume !(0 != ~__CS_ret~0 % 256); [2021-08-27 17:31:25,284 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-35: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,284 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-35: assume !(0 != ~__CS_ret~0 % 256); [2021-08-27 17:31:25,284 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-36: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,285 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-36: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5; [2021-08-27 17:31:25,285 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-37: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,285 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-37: assume !(0 != ~__CS_ret~0 % 256); [2021-08-27 17:31:25,285 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-59: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,285 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-59: assume !(0 != ~__CS_ret~0 % 256); [2021-08-27 17:31:25,285 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-60: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,285 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-60: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5; [2021-08-27 17:31:25,285 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-61: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,285 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-61: assume !(0 != ~__CS_ret~0 % 256); [2021-08-27 17:31:25,285 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-83: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,286 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-83: assume !(0 != ~__CS_ret~0 % 256); [2021-08-27 17:31:25,286 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-84: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,286 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-84: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5; [2021-08-27 17:31:25,286 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-85: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-08-27 17:31:25,286 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-85: assume !(0 != ~__CS_ret~0 % 256); [2021-08-27 17:31:25,286 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-33: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,286 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-33: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-08-27 17:31:25,286 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-35: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,286 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,287 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,287 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-35: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,287 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,287 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,287 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-99: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,287 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-99: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-08-27 17:31:25,287 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-38: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,287 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-39: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,287 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-39: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,287 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-101: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,287 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-41: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##421: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##420: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##428: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-165: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-165: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-08-27 17:31:25,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-105: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-105: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-167: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-107: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,289 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-108: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,289 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-108: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,289 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-110: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,289 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-111: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,289 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-111: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,289 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-113: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,289 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-231: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,289 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-231: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-08-27 17:31:25,289 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-233: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,289 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-177: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,289 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-177: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,290 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-179: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,290 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-180: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,290 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-180: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,290 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-182: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,290 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-183: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,290 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-183: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,290 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-185: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,290 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-249: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,290 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-249: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,290 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-251: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,290 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-252: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,291 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-252: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,291 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-254: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,291 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-255: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-27 17:31:25,291 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-255: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-27 17:31:25,291 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-257: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-27 17:31:25,291 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##951: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,291 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##950: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,291 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##958: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,291 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##957: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,291 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##155: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,292 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##156: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,292 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-27 17:31:25,292 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-27 17:31:25,302 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:31:25,302 INFO L299 CfgBuilder]: Removed 349 assume(true) statements. [2021-08-27 17:31:25,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:31:25 BoogieIcfgContainer [2021-08-27 17:31:25,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:31:25,305 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:31:25,305 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:31:25,308 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:31:25,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:31:25,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:31:09" (1/3) ... [2021-08-27 17:31:25,309 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7921c4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:31:25, skipping insertion in model container [2021-08-27 17:31:25,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:31:25,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:31:09" (2/3) ... [2021-08-27 17:31:25,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7921c4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:31:25, skipping insertion in model container [2021-08-27 17:31:25,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:31:25,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:31:25" (3/3) ... [2021-08-27 17:31:25,311 INFO L389 chiAutomizerObserver]: Analyzing ICFG cs_lazy.i [2021-08-27 17:31:25,343 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:31:25,344 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:31:25,344 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:31:25,344 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:31:25,344 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:31:25,344 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:31:25,344 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:31:25,344 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:31:25,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 686 states, 685 states have (on average 1.564963503649635) internal successors, (1072), 685 states have internal predecessors, (1072), 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-08-27 17:31:25,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 17:31:25,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:31:25,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:31:25,440 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:31:25,440 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:31:25,440 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:31:25,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 686 states, 685 states have (on average 1.564963503649635) internal successors, (1072), 685 states have internal predecessors, (1072), 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-08-27 17:31:25,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 17:31:25,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:31:25,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:31:25,452 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:31:25,452 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 17:31:25,456 INFO L791 eck$LassoCheckResult]: Stem: 667#ULTIMATE.startENTRYtrue havoc ULTIMATE.init_#t~nondet96, ULTIMATE.init_#t~nondet97;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 3 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 3 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[3 := 0], ~__CS_thread~0.offset[3 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 6 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 7 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(32);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 24 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 28 + ~#__CS_thread_lockedon~0.offset, 4);call ~#mutex~0.base, ~#mutex~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mutex~0.base, ~#mutex~0.offset, 1);call write~init~int(0, ~#mutex~0.base, 1 + ~#mutex~0.offset, 1);call ~#data~0.base, ~#data~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data~0.base, ~#data~0.offset, 4);call write~init~int(0, ~#data~0.base, 4 + ~#data~0.offset, 4);~__CS_u~0.mutex := ~__CS_u~0.mutex[0 := 0];~__CS_u~0.mutex := ~__CS_u~0.mutex[1 := 0];~__CS_u~0.data := ~__CS_u~0.data[0 := ULTIMATE.init_#t~nondet96];~__CS_u~0.data := ~__CS_u~0.data[1 := ULTIMATE.init_#t~nondet97];havoc ULTIMATE.init_#t~nondet96;havoc ULTIMATE.init_#t~nondet97; 575#L-1true havoc main_#res;havoc main_#t~nondet46, main_#t~nondet47, main_#t~pre45, main_~j~2, main_#t~nondet48, main_#t~nondet49, main_#t~pre44, main_~i~0, main_#t~mem50, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54.base, main_#t~mem54.offset, main_#t~mem55.base, main_#t~mem55.offset, main_#t~mem56.base, main_#t~mem56.offset, main_#t~mem57.base, main_#t~mem57.offset, main_#t~mem58, main_#t~mem59, main_#t~mem60, main_#t~mem61, main_#t~ret63.base, main_#t~ret63.offset, main_#t~mem64, main_#t~mem65, main_#t~ret67.base, main_#t~ret67.offset, main_#t~mem68, main_#t~mem69, main_#t~ret71.base, main_#t~ret71.offset, main_#t~mem72, main_#t~mem73, main_#t~ret75.base, main_#t~ret75.offset, main_#t~mem76, main_#t~mem77, main_#t~mem78, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82, main_#t~mem83, main_#t~mem84.base, main_#t~mem84.offset, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88.base, main_#t~mem88.offset, main_#t~mem89.base, main_#t~mem89.offset, main_#t~mem90.base, main_#t~mem90.offset, main_#t~mem91.base, main_#t~mem91.offset, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset, main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(32);call main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 423#L747-3true [2021-08-27 17:31:25,456 INFO L793 eck$LassoCheckResult]: Loop: 423#L747-3true assume !!(main_~i~0 < 2);main_~j~2 := 0; 602#L748-3true assume !(main_~j~2 < 4); 416#L748-4true call write~int(main_#t~nondet48, main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset + main_~i~0, 1);havoc main_#t~nondet48;call write~int(main_#t~nondet49, main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet49; 388#L747-2true main_#t~pre44 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre44; 423#L747-3true [2021-08-27 17:31:25,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:31:25,461 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 17:31:25,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:31:25,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108222242] [2021-08-27 17:31:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:25,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:31:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:25,643 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:31:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:25,749 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:31:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:31:25,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1237577, now seen corresponding path program 1 times [2021-08-27 17:31:25,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:31:25,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539423944] [2021-08-27 17:31:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:25,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:31:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:31:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:31:25,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:31:25,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539423944] [2021-08-27 17:31:25,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539423944] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:31:25,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:31:25,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 17:31:25,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129057038] [2021-08-27 17:31:25,846 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:31:25,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:31:25,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:31:25,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:31:25,863 INFO L87 Difference]: Start difference. First operand has 686 states, 685 states have (on average 1.564963503649635) internal successors, (1072), 685 states have internal predecessors, (1072), 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 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-08-27 17:31:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:31:25,927 INFO L93 Difference]: Finished difference Result 688 states and 965 transitions. [2021-08-27 17:31:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:31:25,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 688 states and 965 transitions. [2021-08-27 17:31:25,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-08-27 17:31:25,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 688 states to 9 states and 10 transitions. [2021-08-27 17:31:25,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-08-27 17:31:25,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-08-27 17:31:25,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2021-08-27 17:31:25,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:31:25,945 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-27 17:31:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2021-08-27 17:31:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2021-08-27 17:31:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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-08-27 17:31:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-08-27 17:31:25,967 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-08-27 17:31:25,968 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-08-27 17:31:25,968 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:31:25,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2021-08-27 17:31:25,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 17:31:25,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:31:25,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:31:25,969 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:31:25,969 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:31:25,969 INFO L791 eck$LassoCheckResult]: Stem: 1385#ULTIMATE.startENTRY havoc ULTIMATE.init_#t~nondet96, ULTIMATE.init_#t~nondet97;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 3 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 3 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[3 := 0], ~__CS_thread~0.offset[3 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 6 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 7 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(32);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 24 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 28 + ~#__CS_thread_lockedon~0.offset, 4);call ~#mutex~0.base, ~#mutex~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mutex~0.base, ~#mutex~0.offset, 1);call write~init~int(0, ~#mutex~0.base, 1 + ~#mutex~0.offset, 1);call ~#data~0.base, ~#data~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data~0.base, ~#data~0.offset, 4);call write~init~int(0, ~#data~0.base, 4 + ~#data~0.offset, 4);~__CS_u~0.mutex := ~__CS_u~0.mutex[0 := 0];~__CS_u~0.mutex := ~__CS_u~0.mutex[1 := 0];~__CS_u~0.data := ~__CS_u~0.data[0 := ULTIMATE.init_#t~nondet96];~__CS_u~0.data := ~__CS_u~0.data[1 := ULTIMATE.init_#t~nondet97];havoc ULTIMATE.init_#t~nondet96;havoc ULTIMATE.init_#t~nondet97; 1386#L-1 havoc main_#res;havoc main_#t~nondet46, main_#t~nondet47, main_#t~pre45, main_~j~2, main_#t~nondet48, main_#t~nondet49, main_#t~pre44, main_~i~0, main_#t~mem50, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54.base, main_#t~mem54.offset, main_#t~mem55.base, main_#t~mem55.offset, main_#t~mem56.base, main_#t~mem56.offset, main_#t~mem57.base, main_#t~mem57.offset, main_#t~mem58, main_#t~mem59, main_#t~mem60, main_#t~mem61, main_#t~ret63.base, main_#t~ret63.offset, main_#t~mem64, main_#t~mem65, main_#t~ret67.base, main_#t~ret67.offset, main_#t~mem68, main_#t~mem69, main_#t~ret71.base, main_#t~ret71.offset, main_#t~mem72, main_#t~mem73, main_#t~ret75.base, main_#t~ret75.offset, main_#t~mem76, main_#t~mem77, main_#t~mem78, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82, main_#t~mem83, main_#t~mem84.base, main_#t~mem84.offset, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88.base, main_#t~mem88.offset, main_#t~mem89.base, main_#t~mem89.offset, main_#t~mem90.base, main_#t~mem90.offset, main_#t~mem91.base, main_#t~mem91.offset, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset, main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(32);call main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 1387#L747-3 [2021-08-27 17:31:25,969 INFO L793 eck$LassoCheckResult]: Loop: 1387#L747-3 assume !!(main_~i~0 < 2);main_~j~2 := 0; 1383#L748-3 assume !!(main_~j~2 < 4);call write~int(main_#t~nondet46, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 4 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet46;call write~$Pointer$(0, (if main_#t~nondet47 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47 % 4294967296 % 4294967296 else main_#t~nondet47 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 16 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet47; 1384#L748-2 main_#t~pre45 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre45; 1388#L748-3 assume !(main_~j~2 < 4); 1389#L748-4 call write~int(main_#t~nondet48, main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset + main_~i~0, 1);havoc main_#t~nondet48;call write~int(main_#t~nondet49, main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet49; 1390#L747-2 main_#t~pre44 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre44; 1387#L747-3 [2021-08-27 17:31:25,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:31:25,970 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 17:31:25,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:31:25,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288179158] [2021-08-27 17:31:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:25,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:31:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:26,014 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:31:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:26,055 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:31:26,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:31:26,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1191030535, now seen corresponding path program 1 times [2021-08-27 17:31:26,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:31:26,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607646323] [2021-08-27 17:31:26,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:26,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:31:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:31:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:31:26,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:31:26,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607646323] [2021-08-27 17:31:26,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607646323] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:31:26,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789709083] [2021-08-27 17:31:26,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:26,122 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:31:26,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:31:26,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:31:26,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 17:31:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:31:26,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:31:26,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:31:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:31:26,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789709083] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:31:26,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:31:26,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-08-27 17:31:26,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800651469] [2021-08-27 17:31:26,401 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:31:26,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:31:26,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:31:26,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:31:26,402 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-08-27 17:31:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:31:26,429 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2021-08-27 17:31:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:31:26,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2021-08-27 17:31:26,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-08-27 17:31:26,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2021-08-27 17:31:26,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 17:31:26,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 17:31:26,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2021-08-27 17:31:26,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:31:26,431 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-08-27 17:31:26,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2021-08-27 17:31:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2021-08-27 17:31:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 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-08-27 17:31:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-08-27 17:31:26,433 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-27 17:31:26,433 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-27 17:31:26,433 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:31:26,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2021-08-27 17:31:26,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-08-27 17:31:26,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:31:26,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:31:26,434 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:31:26,434 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2021-08-27 17:31:26,434 INFO L791 eck$LassoCheckResult]: Stem: 1426#ULTIMATE.startENTRY havoc ULTIMATE.init_#t~nondet96, ULTIMATE.init_#t~nondet97;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 3 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 3 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[3 := 0], ~__CS_thread~0.offset[3 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 6 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 7 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(32);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 24 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 28 + ~#__CS_thread_lockedon~0.offset, 4);call ~#mutex~0.base, ~#mutex~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mutex~0.base, ~#mutex~0.offset, 1);call write~init~int(0, ~#mutex~0.base, 1 + ~#mutex~0.offset, 1);call ~#data~0.base, ~#data~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data~0.base, ~#data~0.offset, 4);call write~init~int(0, ~#data~0.base, 4 + ~#data~0.offset, 4);~__CS_u~0.mutex := ~__CS_u~0.mutex[0 := 0];~__CS_u~0.mutex := ~__CS_u~0.mutex[1 := 0];~__CS_u~0.data := ~__CS_u~0.data[0 := ULTIMATE.init_#t~nondet96];~__CS_u~0.data := ~__CS_u~0.data[1 := ULTIMATE.init_#t~nondet97];havoc ULTIMATE.init_#t~nondet96;havoc ULTIMATE.init_#t~nondet97; 1427#L-1 havoc main_#res;havoc main_#t~nondet46, main_#t~nondet47, main_#t~pre45, main_~j~2, main_#t~nondet48, main_#t~nondet49, main_#t~pre44, main_~i~0, main_#t~mem50, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54.base, main_#t~mem54.offset, main_#t~mem55.base, main_#t~mem55.offset, main_#t~mem56.base, main_#t~mem56.offset, main_#t~mem57.base, main_#t~mem57.offset, main_#t~mem58, main_#t~mem59, main_#t~mem60, main_#t~mem61, main_#t~ret63.base, main_#t~ret63.offset, main_#t~mem64, main_#t~mem65, main_#t~ret67.base, main_#t~ret67.offset, main_#t~mem68, main_#t~mem69, main_#t~ret71.base, main_#t~ret71.offset, main_#t~mem72, main_#t~mem73, main_#t~ret75.base, main_#t~ret75.offset, main_#t~mem76, main_#t~mem77, main_#t~mem78, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82, main_#t~mem83, main_#t~mem84.base, main_#t~mem84.offset, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88.base, main_#t~mem88.offset, main_#t~mem89.base, main_#t~mem89.offset, main_#t~mem90.base, main_#t~mem90.offset, main_#t~mem91.base, main_#t~mem91.offset, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset, main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(32);call main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 1428#L747-3 [2021-08-27 17:31:26,435 INFO L793 eck$LassoCheckResult]: Loop: 1428#L747-3 assume !!(main_~i~0 < 2);main_~j~2 := 0; 1429#L748-3 assume !!(main_~j~2 < 4);call write~int(main_#t~nondet46, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 4 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet46;call write~$Pointer$(0, (if main_#t~nondet47 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47 % 4294967296 % 4294967296 else main_#t~nondet47 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 16 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet47; 1430#L748-2 main_#t~pre45 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre45; 1424#L748-3 assume !!(main_~j~2 < 4);call write~int(main_#t~nondet46, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 4 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet46;call write~$Pointer$(0, (if main_#t~nondet47 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47 % 4294967296 % 4294967296 else main_#t~nondet47 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 16 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet47; 1425#L748-2 main_#t~pre45 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre45; 1433#L748-3 assume !(main_~j~2 < 4); 1431#L748-4 call write~int(main_#t~nondet48, main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset + main_~i~0, 1);havoc main_#t~nondet48;call write~int(main_#t~nondet49, main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet49; 1432#L747-2 main_#t~pre44 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre44; 1428#L747-3 [2021-08-27 17:31:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:31:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 17:31:26,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:31:26,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191281556] [2021-08-27 17:31:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:26,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:31:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:26,451 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:31:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:26,483 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:31:26,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:31:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2120762437, now seen corresponding path program 2 times [2021-08-27 17:31:26,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:31:26,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736573230] [2021-08-27 17:31:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:26,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:31:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:31:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:31:26,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:31:26,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736573230] [2021-08-27 17:31:26,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736573230] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:31:26,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063720147] [2021-08-27 17:31:26,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:31:26,611 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:31:26,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:31:26,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:31:26,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 17:31:26,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:31:26,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:31:26,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:31:26,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:31:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:31:26,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063720147] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:31:26,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:31:26,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-27 17:31:26,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475183972] [2021-08-27 17:31:26,849 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:31:26,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:31:26,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:31:26,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:31:26,850 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-08-27 17:31:26,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:31:26,879 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2021-08-27 17:31:26,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:31:26,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2021-08-27 17:31:26,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2021-08-27 17:31:26,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2021-08-27 17:31:26,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-08-27 17:31:26,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-08-27 17:31:26,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2021-08-27 17:31:26,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:31:26,883 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-27 17:31:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2021-08-27 17:31:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-08-27 17:31:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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-08-27 17:31:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-08-27 17:31:26,884 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-08-27 17:31:26,887 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-08-27 17:31:26,887 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:31:26,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2021-08-27 17:31:26,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2021-08-27 17:31:26,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:31:26,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:31:26,888 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:31:26,888 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 1, 1, 1, 1] [2021-08-27 17:31:26,889 INFO L791 eck$LassoCheckResult]: Stem: 1478#ULTIMATE.startENTRY havoc ULTIMATE.init_#t~nondet96, ULTIMATE.init_#t~nondet97;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 3 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 3 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[3 := 0], ~__CS_thread~0.offset[3 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 6 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 7 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(32);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 24 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 28 + ~#__CS_thread_lockedon~0.offset, 4);call ~#mutex~0.base, ~#mutex~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mutex~0.base, ~#mutex~0.offset, 1);call write~init~int(0, ~#mutex~0.base, 1 + ~#mutex~0.offset, 1);call ~#data~0.base, ~#data~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data~0.base, ~#data~0.offset, 4);call write~init~int(0, ~#data~0.base, 4 + ~#data~0.offset, 4);~__CS_u~0.mutex := ~__CS_u~0.mutex[0 := 0];~__CS_u~0.mutex := ~__CS_u~0.mutex[1 := 0];~__CS_u~0.data := ~__CS_u~0.data[0 := ULTIMATE.init_#t~nondet96];~__CS_u~0.data := ~__CS_u~0.data[1 := ULTIMATE.init_#t~nondet97];havoc ULTIMATE.init_#t~nondet96;havoc ULTIMATE.init_#t~nondet97; 1479#L-1 havoc main_#res;havoc main_#t~nondet46, main_#t~nondet47, main_#t~pre45, main_~j~2, main_#t~nondet48, main_#t~nondet49, main_#t~pre44, main_~i~0, main_#t~mem50, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54.base, main_#t~mem54.offset, main_#t~mem55.base, main_#t~mem55.offset, main_#t~mem56.base, main_#t~mem56.offset, main_#t~mem57.base, main_#t~mem57.offset, main_#t~mem58, main_#t~mem59, main_#t~mem60, main_#t~mem61, main_#t~ret63.base, main_#t~ret63.offset, main_#t~mem64, main_#t~mem65, main_#t~ret67.base, main_#t~ret67.offset, main_#t~mem68, main_#t~mem69, main_#t~ret71.base, main_#t~ret71.offset, main_#t~mem72, main_#t~mem73, main_#t~ret75.base, main_#t~ret75.offset, main_#t~mem76, main_#t~mem77, main_#t~mem78, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82, main_#t~mem83, main_#t~mem84.base, main_#t~mem84.offset, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88.base, main_#t~mem88.offset, main_#t~mem89.base, main_#t~mem89.offset, main_#t~mem90.base, main_#t~mem90.offset, main_#t~mem91.base, main_#t~mem91.offset, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset, main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(32);call main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 1480#L747-3 [2021-08-27 17:31:26,889 INFO L793 eck$LassoCheckResult]: Loop: 1480#L747-3 assume !!(main_~i~0 < 2);main_~j~2 := 0; 1481#L748-3 assume !!(main_~j~2 < 4);call write~int(main_#t~nondet46, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 4 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet46;call write~$Pointer$(0, (if main_#t~nondet47 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47 % 4294967296 % 4294967296 else main_#t~nondet47 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 16 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet47; 1482#L748-2 main_#t~pre45 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre45; 1476#L748-3 assume !!(main_~j~2 < 4);call write~int(main_#t~nondet46, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 4 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet46;call write~$Pointer$(0, (if main_#t~nondet47 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47 % 4294967296 % 4294967296 else main_#t~nondet47 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 16 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet47; 1477#L748-2 main_#t~pre45 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre45; 1487#L748-3 assume !!(main_~j~2 < 4);call write~int(main_#t~nondet46, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 4 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet46;call write~$Pointer$(0, (if main_#t~nondet47 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47 % 4294967296 % 4294967296 else main_#t~nondet47 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 16 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet47; 1486#L748-2 main_#t~pre45 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre45; 1485#L748-3 assume !(main_~j~2 < 4); 1483#L748-4 call write~int(main_#t~nondet48, main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset + main_~i~0, 1);havoc main_#t~nondet48;call write~int(main_#t~nondet49, main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet49; 1484#L747-2 main_#t~pre44 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre44; 1480#L747-3 [2021-08-27 17:31:26,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:31:26,889 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 17:31:26,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:31:26,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157656711] [2021-08-27 17:31:26,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:26,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:31:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:26,903 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:31:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:26,920 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:31:26,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:31:26,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2055044605, now seen corresponding path program 3 times [2021-08-27 17:31:26,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:31:26,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880352142] [2021-08-27 17:31:26,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:26,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:31:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:31:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:31:27,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:31:27,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880352142] [2021-08-27 17:31:27,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880352142] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:31:27,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664815631] [2021-08-27 17:31:27,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:31:27,010 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:31:27,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:31:27,011 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:31:27,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 17:31:27,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 17:31:27,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:31:27,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:31:27,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:31:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:31:27,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664815631] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:31:27,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:31:27,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-08-27 17:31:27,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307649217] [2021-08-27 17:31:27,284 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:31:27,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:31:27,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 17:31:27,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 17:31:27,287 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-08-27 17:31:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:31:27,329 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2021-08-27 17:31:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:31:27,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2021-08-27 17:31:27,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-08-27 17:31:27,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2021-08-27 17:31:27,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-08-27 17:31:27,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-08-27 17:31:27,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2021-08-27 17:31:27,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:31:27,337 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-08-27 17:31:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2021-08-27 17:31:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-08-27 17:31:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 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-08-27 17:31:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-08-27 17:31:27,339 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-08-27 17:31:27,339 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-08-27 17:31:27,339 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:31:27,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2021-08-27 17:31:27,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-08-27 17:31:27,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:31:27,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:31:27,340 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:31:27,340 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1] [2021-08-27 17:31:27,340 INFO L791 eck$LassoCheckResult]: Stem: 1540#ULTIMATE.startENTRY havoc ULTIMATE.init_#t~nondet96, ULTIMATE.init_#t~nondet97;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 3 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 3 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[3 := 0], ~__CS_thread~0.offset[3 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 6 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 7 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(32);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 24 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 28 + ~#__CS_thread_lockedon~0.offset, 4);call ~#mutex~0.base, ~#mutex~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mutex~0.base, ~#mutex~0.offset, 1);call write~init~int(0, ~#mutex~0.base, 1 + ~#mutex~0.offset, 1);call ~#data~0.base, ~#data~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data~0.base, ~#data~0.offset, 4);call write~init~int(0, ~#data~0.base, 4 + ~#data~0.offset, 4);~__CS_u~0.mutex := ~__CS_u~0.mutex[0 := 0];~__CS_u~0.mutex := ~__CS_u~0.mutex[1 := 0];~__CS_u~0.data := ~__CS_u~0.data[0 := ULTIMATE.init_#t~nondet96];~__CS_u~0.data := ~__CS_u~0.data[1 := ULTIMATE.init_#t~nondet97];havoc ULTIMATE.init_#t~nondet96;havoc ULTIMATE.init_#t~nondet97; 1541#L-1 havoc main_#res;havoc main_#t~nondet46, main_#t~nondet47, main_#t~pre45, main_~j~2, main_#t~nondet48, main_#t~nondet49, main_#t~pre44, main_~i~0, main_#t~mem50, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54.base, main_#t~mem54.offset, main_#t~mem55.base, main_#t~mem55.offset, main_#t~mem56.base, main_#t~mem56.offset, main_#t~mem57.base, main_#t~mem57.offset, main_#t~mem58, main_#t~mem59, main_#t~mem60, main_#t~mem61, main_#t~ret63.base, main_#t~ret63.offset, main_#t~mem64, main_#t~mem65, main_#t~ret67.base, main_#t~ret67.offset, main_#t~mem68, main_#t~mem69, main_#t~ret71.base, main_#t~ret71.offset, main_#t~mem72, main_#t~mem73, main_#t~ret75.base, main_#t~ret75.offset, main_#t~mem76, main_#t~mem77, main_#t~mem78, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82, main_#t~mem83, main_#t~mem84.base, main_#t~mem84.offset, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88.base, main_#t~mem88.offset, main_#t~mem89.base, main_#t~mem89.offset, main_#t~mem90.base, main_#t~mem90.offset, main_#t~mem91.base, main_#t~mem91.offset, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset, main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(32);call main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 1542#L747-3 [2021-08-27 17:31:27,341 INFO L793 eck$LassoCheckResult]: Loop: 1542#L747-3 assume !!(main_~i~0 < 2);main_~j~2 := 0; 1543#L748-3 assume !!(main_~j~2 < 4);call write~int(main_#t~nondet46, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 4 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet46;call write~$Pointer$(0, (if main_#t~nondet47 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47 % 4294967296 % 4294967296 else main_#t~nondet47 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 16 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet47; 1544#L748-2 main_#t~pre45 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre45; 1538#L748-3 assume !!(main_~j~2 < 4);call write~int(main_#t~nondet46, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 4 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet46;call write~$Pointer$(0, (if main_#t~nondet47 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47 % 4294967296 % 4294967296 else main_#t~nondet47 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 16 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet47; 1539#L748-2 main_#t~pre45 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre45; 1551#L748-3 assume !!(main_~j~2 < 4);call write~int(main_#t~nondet46, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 4 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet46;call write~$Pointer$(0, (if main_#t~nondet47 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47 % 4294967296 % 4294967296 else main_#t~nondet47 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 16 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet47; 1550#L748-2 main_#t~pre45 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre45; 1549#L748-3 assume !!(main_~j~2 < 4);call write~int(main_#t~nondet46, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 4 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet46;call write~$Pointer$(0, (if main_#t~nondet47 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47 % 4294967296 % 4294967296 else main_#t~nondet47 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 16 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet47; 1548#L748-2 main_#t~pre45 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre45; 1547#L748-3 assume !(main_~j~2 < 4); 1545#L748-4 call write~int(main_#t~nondet48, main_~#__CS_cp_mutex~0.base, main_~#__CS_cp_mutex~0.offset + main_~i~0, 1);havoc main_#t~nondet48;call write~int(main_#t~nondet49, main_~#__CS_cp_data~0.base, main_~#__CS_cp_data~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet49; 1546#L747-2 main_#t~pre44 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre44; 1542#L747-3 [2021-08-27 17:31:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:31:27,341 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-27 17:31:27,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:31:27,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468539918] [2021-08-27 17:31:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:27,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:31:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:27,356 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:31:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:27,386 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:31:27,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:31:27,387 INFO L82 PathProgramCache]: Analyzing trace with hash 788809793, now seen corresponding path program 4 times [2021-08-27 17:31:27,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:31:27,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391433019] [2021-08-27 17:31:27,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:27,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:31:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:27,431 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:31:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:27,467 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:31:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:31:27,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2002958595, now seen corresponding path program 1 times [2021-08-27 17:31:27,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:31:27,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569837763] [2021-08-27 17:31:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:31:27,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:31:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:27,545 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:31:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:31:27,594 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:33:18,823 WARN L207 SmtUtils]: Spent 1.85 m on a formula simplification. DAG size of input: 318 DAG size of output: 287 [2021-08-27 17:33:21,518 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:313) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:80) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:75) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:235) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateCompat(PartialQuantifierElimination.java:128) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateCompat(PartialQuantifierElimination.java:151) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:248) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.computeTF(LassoCheck.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.computeLoopTF(LassoCheck.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:847) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-27 17:33:21,522 INFO L168 Benchmark]: Toolchain (without parser) took 132234.55 ms. Allocated memory was 56.6 MB in the beginning and 134.2 MB in the end (delta: 77.6 MB). Free memory was 34.1 MB in the beginning and 80.9 MB in the end (delta: -46.8 MB). Peak memory consumption was 81.7 MB. Max. memory is 16.1 GB. [2021-08-27 17:33:21,522 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 38.9 MB in the end (delta: 42.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:33:21,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.75 ms. Allocated memory is still 56.6 MB. Free memory was 33.8 MB in the beginning and 26.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-27 17:33:21,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.24 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 26.5 MB in the beginning and 39.3 MB in the end (delta: -12.8 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.1 GB. [2021-08-27 17:33:21,524 INFO L168 Benchmark]: Boogie Preprocessor took 160.98 ms. Allocated memory is still 69.2 MB. Free memory was 39.3 MB in the beginning and 40.0 MB in the end (delta: -677.5 kB). Peak memory consumption was 15.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:33:21,524 INFO L168 Benchmark]: RCFGBuilder took 15141.77 ms. Allocated memory was 69.2 MB in the beginning and 111.1 MB in the end (delta: 41.9 MB). Free memory was 40.0 MB in the beginning and 36.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 51.5 MB. Max. memory is 16.1 GB. [2021-08-27 17:33:21,525 INFO L168 Benchmark]: BuchiAutomizer took 116215.78 ms. Allocated memory was 111.1 MB in the beginning and 134.2 MB in the end (delta: 23.1 MB). Free memory was 35.7 MB in the beginning and 80.9 MB in the end (delta: -45.2 MB). Peak memory consumption was 28.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:33:21,527 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.19 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 38.9 MB in the end (delta: 42.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 563.75 ms. Allocated memory is still 56.6 MB. Free memory was 33.8 MB in the beginning and 26.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 146.24 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 26.5 MB in the beginning and 39.3 MB in the end (delta: -12.8 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 160.98 ms. Allocated memory is still 69.2 MB. Free memory was 39.3 MB in the beginning and 40.0 MB in the end (delta: -677.5 kB). Peak memory consumption was 15.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 15141.77 ms. Allocated memory was 69.2 MB in the beginning and 111.1 MB in the end (delta: 41.9 MB). Free memory was 40.0 MB in the beginning and 36.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 51.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 116215.78 ms. Allocated memory was 111.1 MB in the beginning and 134.2 MB in the end (delta: 23.1 MB). Free memory was 35.7 MB in the beginning and 80.9 MB in the end (delta: -45.2 MB). Peak memory consumption was 28.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:313) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-27 17:33:21,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 17:33:21,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 17:33:21,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 17:33:22,174 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...