./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 ff03de63 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 b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:48:38,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:48:38,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:48:38,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:48:38,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:48:38,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:48:38,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:48:38,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:48:39,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:48:39,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:48:39,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:48:39,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:48:39,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:48:39,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:48:39,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:48:39,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:48:39,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:48:39,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:48:39,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:48:39,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:48:39,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:48:39,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:48:39,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:48:39,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:48:39,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:48:39,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:48:39,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:48:39,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:48:39,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:48:39,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:48:39,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:48:39,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:48:39,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:48:39,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:48:39,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:48:39,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:48:39,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:48:39,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:48:39,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:48:39,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:48:39,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:48:39,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-21 22:48:39,058 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:48:39,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:48:39,059 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:48:39,059 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:48:39,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:48:39,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:48:39,060 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:48:39,060 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:48:39,061 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:48:39,061 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:48:39,061 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:48:39,062 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:48:39,062 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:48:39,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:48:39,062 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 22:48:39,062 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:48:39,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:48:39,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 22:48:39,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:48:39,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:48:39,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:48:39,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:48:39,063 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 22:48:39,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:48:39,064 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:48:39,064 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:48:39,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:48:39,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:48:39,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:48:39,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:48:39,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:48:39,065 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:48:39,066 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:48:39,066 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 -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2021-12-21 22:48:39,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:48:39,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:48:39,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:48:39,285 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:48:39,287 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:48:39,288 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-12-21 22:48:39,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713d147ab/f9d54936de404f41b94d19849c567b84/FLAG8bc64b53d [2021-12-21 22:48:39,830 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:48:39,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2021-12-21 22:48:39,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713d147ab/f9d54936de404f41b94d19849c567b84/FLAG8bc64b53d [2021-12-21 22:48:40,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713d147ab/f9d54936de404f41b94d19849c567b84 [2021-12-21 22:48:40,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:48:40,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:48:40,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:48:40,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:48:40,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:48:40,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:40,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521f713f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40, skipping insertion in model container [2021-12-21 22:48:40,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:40,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:48:40,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:48:40,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2021-12-21 22:48:40,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:48:40,706 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:48:40,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2021-12-21 22:48:40,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:48:40,795 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:48:40,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40 WrapperNode [2021-12-21 22:48:40,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:48:40,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:48:40,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:48:40,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:48:40,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:40,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:40,928 INFO L137 Inliner]: procedures = 145, calls = 212, calls flagged for inlining = 48, calls inlined = 171, statements flattened = 3145 [2021-12-21 22:48:40,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:48:40,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:48:40,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:48:40,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:48:40,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:40,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:40,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:40,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:40,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:41,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:41,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:41,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:48:41,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:48:41,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:48:41,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:48:41,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40" (1/1) ... [2021-12-21 22:48:41,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:48:41,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:48:41,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:48:41,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-21 22:48:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 22:48:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 22:48:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 22:48:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 22:48:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 22:48:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 22:48:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 22:48:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 22:48:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 22:48:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:48:41,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:48:41,205 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:48:41,206 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:48:41,221 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 22:48:41,222 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 22:48:41,252 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 22:48:41,253 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 22:48:41,270 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 22:48:41,271 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 22:48:41,288 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 22:48:41,295 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 22:48:43,152 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##686: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,153 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,153 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##693: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,153 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##692: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,153 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,154 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,154 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-13: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,154 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-35: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,154 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-36: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,154 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-37: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,154 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-59: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,154 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-60: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,154 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-61: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,155 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-83: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,155 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-84: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,155 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-85: assume { :end_inline___CS_cs } true; [2021-12-21 22:48:43,155 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-33: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,155 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-33: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2); [2021-12-21 22:48:43,155 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-35: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,155 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,156 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,156 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-35: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,156 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,156 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,156 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-99: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,156 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-99: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2); [2021-12-21 22:48:43,156 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-38: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,157 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-39: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,157 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-39: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,157 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-101: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,157 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-41: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,157 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##421: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,157 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##420: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,157 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,157 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##428: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,158 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-165: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,158 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-165: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2); [2021-12-21 22:48:43,158 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-105: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,158 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-105: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,158 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-167: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,158 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-107: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,158 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-108: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,159 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-108: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,159 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-110: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,159 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-111: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,159 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-111: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,159 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-113: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,159 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-231: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,159 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-231: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2); [2021-12-21 22:48:43,160 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-233: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,160 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-177: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,160 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-177: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,160 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-179: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,160 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-180: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,160 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-180: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,160 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-182: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,160 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-183: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,161 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-183: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,161 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-185: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,161 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-249: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,161 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-249: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,161 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-251: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,161 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-252: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,161 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-252: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,162 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-254: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,162 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-255: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2021-12-21 22:48:43,162 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-255: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2021-12-21 22:48:43,162 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-257: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2021-12-21 22:48:43,162 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,162 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume !(0 != ~__CS_ret~0 % 256); [2021-12-21 22:48:43,162 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,163 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: assume !(0 != ~__CS_ret~0 % 256); [2021-12-21 22:48:43,163 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-4: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,163 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-4: assume !(0 != ~__CS_ret~0 % 256); [2021-12-21 22:48:43,163 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-6: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,163 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-6: assume !(0 != ~__CS_ret~0 % 256); [2021-12-21 22:48:43,163 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,163 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: assume !(0 != ~__CS_ret~0 % 256);assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2021-12-21 22:48:43,163 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-2: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,164 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-2: assume !(0 != ~__CS_ret~0 % 256);assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2021-12-21 22:48:43,164 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-4: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,164 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-4: assume !(0 != ~__CS_ret~0 % 256);assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2021-12-21 22:48:43,164 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-6: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,164 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-6: assume !(0 != ~__CS_ret~0 % 256);assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2021-12-21 22:48:43,164 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,164 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: assume !(0 != ~__CS_ret~0 % 256); [2021-12-21 22:48:43,165 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-2: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,165 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-2: assume !(0 != ~__CS_ret~0 % 256); [2021-12-21 22:48:43,165 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-4: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,165 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-4: assume !(0 != ~__CS_ret~0 % 256); [2021-12-21 22:48:43,165 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-6: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2021-12-21 22:48:43,165 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-6: assume !(0 != ~__CS_ret~0 % 256); [2021-12-21 22:48:43,165 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##951: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,166 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##950: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,166 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##958: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,166 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##957: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,166 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##155: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,166 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##156: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,166 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2021-12-21 22:48:43,166 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2021-12-21 22:48:43,167 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:48:43,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:48:43,175 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-21 22:48:43,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:48:43 BoogieIcfgContainer [2021-12-21 22:48:43,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:48:43,178 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:48:43,178 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:48:43,180 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:48:43,181 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:48:43,181 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:48:40" (1/3) ... [2021-12-21 22:48:43,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@786a874c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:48:43, skipping insertion in model container [2021-12-21 22:48:43,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:48:43,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:48:40" (2/3) ... [2021-12-21 22:48:43,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@786a874c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:48:43, skipping insertion in model container [2021-12-21 22:48:43,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:48:43,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:48:43" (3/3) ... [2021-12-21 22:48:43,183 INFO L388 chiAutomizerObserver]: Analyzing ICFG cs_lazy.i [2021-12-21 22:48:43,209 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:48:43,209 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:48:43,209 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:48:43,210 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:48:43,210 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:48:43,210 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:48:43,210 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:48:43,210 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:48:43,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 770 states, 769 states have (on average 1.5032509752925878) internal successors, (1156), 769 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:48:43,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 22:48:43,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:48:43,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:48:43,288 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:48:43,288 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-21 22:48:43,289 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:48:43,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 770 states, 769 states have (on average 1.5032509752925878) internal successors, (1156), 769 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:48:43,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 22:48:43,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:48:43,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:48:43,298 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:48:43,298 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-21 22:48:43,302 INFO L791 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet94#1, ULTIMATE.init_#t~nondet95#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(4, 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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(32, 6);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);~#mutex~0.base, ~#mutex~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#data~0.base, ~#data~0.offset := 8, 0;call #Ultimate.allocInit(8, 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~nondet94#1];~__CS_u~0.data := ~__CS_u~0.data[1 := ULTIMATE.init_#t~nondet95#1];havoc ULTIMATE.init_#t~nondet94#1;havoc ULTIMATE.init_#t~nondet95#1; 705#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~nondet45#1, main_#t~pre43#1, main_~j~2#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~pre42#1, main_~i~0#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem51#1, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~ret61#1.base, main_#t~ret61#1.offset, main_#t~mem62#1, main_#t~mem63#1, main_#t~ret65#1.base, main_#t~ret65#1.offset, main_#t~mem66#1, main_#t~mem67#1, main_#t~ret69#1.base, main_#t~ret69#1.offset, main_#t~mem70#1, main_#t~mem71#1, main_#t~ret73#1.base, main_#t~ret73#1.offset, main_#t~mem74#1, main_#t~mem75#1, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_mutex~0#1.base, main_~#__CS_cp_mutex~0#1.offset, main_~#__CS_cp_data~0#1.base, main_~#__CS_cp_data~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(32);call main_~#__CS_cp_mutex~0#1.base, main_~#__CS_cp_mutex~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data~0#1.base, main_~#__CS_cp_data~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 628#L747-3true [2021-12-21 22:48:43,302 INFO L793 eck$LassoCheckResult]: Loop: 628#L747-3true assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 720#L748-3true assume !(main_~j~2#1 < 4); 624#L748-4true call write~int(main_#t~nondet46#1, main_~#__CS_cp_mutex~0#1.base, main_~#__CS_cp_mutex~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet46#1;call write~int(main_#t~nondet47#1, main_~#__CS_cp_data~0#1.base, main_~#__CS_cp_data~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet47#1; 614#L747-2true main_#t~pre42#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre42#1; 628#L747-3true [2021-12-21 22:48:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:48:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-21 22:48:43,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:48:43,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457440306] [2021-12-21 22:48:43,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:48:43,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:48:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:48:43,488 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:48:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:48:43,548 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:48:43,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:48:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1237577, now seen corresponding path program 1 times [2021-12-21 22:48:43,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:48:43,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052536608] [2021-12-21 22:48:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:48:43,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:48:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:48:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:48:43,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:48:43,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052536608] [2021-12-21 22:48:43,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052536608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:48:43,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:48:43,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 22:48:43,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535547721] [2021-12-21 22:48:43,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:48:43,609 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:48:43,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:48:43,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:48:43,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:48:43,633 INFO L87 Difference]: Start difference. First operand has 770 states, 769 states have (on average 1.5032509752925878) internal successors, (1156), 769 states have internal predecessors, (1156), 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-12-21 22:48:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:48:43,748 INFO L93 Difference]: Finished difference Result 772 states and 1049 transitions. [2021-12-21 22:48:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:48:43,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 772 states and 1049 transitions. [2021-12-21 22:48:43,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-21 22:48:43,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 772 states to 9 states and 10 transitions. [2021-12-21 22:48:43,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-21 22:48:43,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-21 22:48:43,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2021-12-21 22:48:43,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:48:43,761 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-12-21 22:48:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2021-12-21 22:48:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2021-12-21 22:48:43,777 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-12-21 22:48:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-12-21 22:48:43,778 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-21 22:48:43,778 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-21 22:48:43,778 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:48:43,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2021-12-21 22:48:43,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-21 22:48:43,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:48:43,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:48:43,779 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:48:43,779 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-21 22:48:43,779 INFO L791 eck$LassoCheckResult]: Stem: 1553#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet94#1, ULTIMATE.init_#t~nondet95#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(4, 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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(32, 6);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);~#mutex~0.base, ~#mutex~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#data~0.base, ~#data~0.offset := 8, 0;call #Ultimate.allocInit(8, 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~nondet94#1];~__CS_u~0.data := ~__CS_u~0.data[1 := ULTIMATE.init_#t~nondet95#1];havoc ULTIMATE.init_#t~nondet94#1;havoc ULTIMATE.init_#t~nondet95#1; 1554#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~nondet45#1, main_#t~pre43#1, main_~j~2#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~pre42#1, main_~i~0#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem51#1, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~ret61#1.base, main_#t~ret61#1.offset, main_#t~mem62#1, main_#t~mem63#1, main_#t~ret65#1.base, main_#t~ret65#1.offset, main_#t~mem66#1, main_#t~mem67#1, main_#t~ret69#1.base, main_#t~ret69#1.offset, main_#t~mem70#1, main_#t~mem71#1, main_#t~ret73#1.base, main_#t~ret73#1.offset, main_#t~mem74#1, main_#t~mem75#1, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_mutex~0#1.base, main_~#__CS_cp_mutex~0#1.offset, main_~#__CS_cp_data~0#1.base, main_~#__CS_cp_data~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(32);call main_~#__CS_cp_mutex~0#1.base, main_~#__CS_cp_mutex~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data~0#1.base, main_~#__CS_cp_data~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 1555#L747-3 [2021-12-21 22:48:43,779 INFO L793 eck$LassoCheckResult]: Loop: 1555#L747-3 assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 1551#L748-3 assume !!(main_~j~2#1 < 4);call write~int(main_#t~nondet44#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 4 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet44#1;call write~$Pointer$(0, (if main_#t~nondet45#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet45#1 % 4294967296 % 4294967296 else main_#t~nondet45#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 16 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet45#1; 1552#L748-2 main_#t~pre43#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre43#1; 1556#L748-3 assume !(main_~j~2#1 < 4); 1557#L748-4 call write~int(main_#t~nondet46#1, main_~#__CS_cp_mutex~0#1.base, main_~#__CS_cp_mutex~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet46#1;call write~int(main_#t~nondet47#1, main_~#__CS_cp_data~0#1.base, main_~#__CS_cp_data~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet47#1; 1558#L747-2 main_#t~pre42#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre42#1; 1555#L747-3 [2021-12-21 22:48:43,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:48:43,781 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-21 22:48:43,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:48:43,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586011852] [2021-12-21 22:48:43,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:48:43,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:48:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:48:43,809 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:48:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:48:43,837 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:48:43,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:48:43,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1191030535, now seen corresponding path program 1 times [2021-12-21 22:48:43,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:48:43,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391908755] [2021-12-21 22:48:43,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:48:43,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:48:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:48:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:48:43,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:48:43,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391908755] [2021-12-21 22:48:43,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391908755] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:48:43,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219240721] [2021-12-21 22:48:43,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:48:43,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:48:43,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:48:43,896 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-12-21 22:48:43,919 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-12-21 22:48:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:48:43,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 22:48:43,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:48:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:48:44,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:48:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:48:44,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219240721] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:48:44,031 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:48:44,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-12-21 22:48:44,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421610418] [2021-12-21 22:48:44,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:48:44,032 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:48:44,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:48:44,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 22:48:44,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-21 22:48:44,033 INFO L87 Difference]: Start difference. First operand 8 states and 9 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-12-21 22:48:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:48:44,071 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2021-12-21 22:48:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 22:48:44,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2021-12-21 22:48:44,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-21 22:48:44,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2021-12-21 22:48:44,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-21 22:48:44,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-21 22:48:44,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2021-12-21 22:48:44,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:48:44,073 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-21 22:48:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2021-12-21 22:48:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-21 22:48:44,074 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-12-21 22:48:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-21 22:48:44,074 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-21 22:48:44,074 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-21 22:48:44,074 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:48:44,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2021-12-21 22:48:44,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-21 22:48:44,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:48:44,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:48:44,075 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:48:44,075 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1] [2021-12-21 22:48:44,075 INFO L791 eck$LassoCheckResult]: Stem: 1616#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet94#1, ULTIMATE.init_#t~nondet95#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(4, 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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(32, 6);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);~#mutex~0.base, ~#mutex~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#data~0.base, ~#data~0.offset := 8, 0;call #Ultimate.allocInit(8, 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~nondet94#1];~__CS_u~0.data := ~__CS_u~0.data[1 := ULTIMATE.init_#t~nondet95#1];havoc ULTIMATE.init_#t~nondet94#1;havoc ULTIMATE.init_#t~nondet95#1; 1617#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~nondet45#1, main_#t~pre43#1, main_~j~2#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~pre42#1, main_~i~0#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem51#1, main_#t~mem52#1.base, main_#t~mem52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~ret61#1.base, main_#t~ret61#1.offset, main_#t~mem62#1, main_#t~mem63#1, main_#t~ret65#1.base, main_#t~ret65#1.offset, main_#t~mem66#1, main_#t~mem67#1, main_#t~ret69#1.base, main_#t~ret69#1.offset, main_#t~mem70#1, main_#t~mem71#1, main_#t~ret73#1.base, main_#t~ret73#1.offset, main_#t~mem74#1, main_#t~mem75#1, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_mutex~0#1.base, main_~#__CS_cp_mutex~0#1.offset, main_~#__CS_cp_data~0#1.base, main_~#__CS_cp_data~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(32);call main_~#__CS_cp_mutex~0#1.base, main_~#__CS_cp_mutex~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data~0#1.base, main_~#__CS_cp_data~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 1614#L747-3 [2021-12-21 22:48:44,076 INFO L793 eck$LassoCheckResult]: Loop: 1614#L747-3 assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 1615#L748-3 assume !!(main_~j~2#1 < 4);call write~int(main_#t~nondet44#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 4 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet44#1;call write~$Pointer$(0, (if main_#t~nondet45#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet45#1 % 4294967296 % 4294967296 else main_#t~nondet45#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 16 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet45#1; 1618#L748-2 main_#t~pre43#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre43#1; 1612#L748-3 assume !!(main_~j~2#1 < 4);call write~int(main_#t~nondet44#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 4 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet44#1;call write~$Pointer$(0, (if main_#t~nondet45#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet45#1 % 4294967296 % 4294967296 else main_#t~nondet45#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 16 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet45#1; 1613#L748-2 main_#t~pre43#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre43#1; 1625#L748-3 assume !!(main_~j~2#1 < 4);call write~int(main_#t~nondet44#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 4 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet44#1;call write~$Pointer$(0, (if main_#t~nondet45#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet45#1 % 4294967296 % 4294967296 else main_#t~nondet45#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 16 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet45#1; 1624#L748-2 main_#t~pre43#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre43#1; 1623#L748-3 assume !!(main_~j~2#1 < 4);call write~int(main_#t~nondet44#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 4 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet44#1;call write~$Pointer$(0, (if main_#t~nondet45#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet45#1 % 4294967296 % 4294967296 else main_#t~nondet45#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 16 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet45#1; 1622#L748-2 main_#t~pre43#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre43#1; 1621#L748-3 assume !(main_~j~2#1 < 4); 1619#L748-4 call write~int(main_#t~nondet46#1, main_~#__CS_cp_mutex~0#1.base, main_~#__CS_cp_mutex~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet46#1;call write~int(main_#t~nondet47#1, main_~#__CS_cp_data~0#1.base, main_~#__CS_cp_data~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet47#1; 1620#L747-2 main_#t~pre42#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre42#1; 1614#L747-3 [2021-12-21 22:48:44,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:48:44,076 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-21 22:48:44,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:48:44,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460263540] [2021-12-21 22:48:44,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:48:44,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:48:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:48:44,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:48:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:48:44,116 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:48:44,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:48:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash 788809793, now seen corresponding path program 2 times [2021-12-21 22:48:44,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:48:44,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892766891] [2021-12-21 22:48:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:48:44,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:48:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:48:44,162 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:48:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:48:44,189 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:48:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:48:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2002958595, now seen corresponding path program 1 times [2021-12-21 22:48:44,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:48:44,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839234139] [2021-12-21 22:48:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:48:44,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:48:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:48:44,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:48:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:48:44,381 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace