./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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_stateful-1.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 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 16:00:47,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 16:00:47,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 16:00:47,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 16:00:47,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 16:00:47,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 16:00:47,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 16:00:47,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 16:00:47,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 16:00:47,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 16:00:47,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 16:00:47,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 16:00:47,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 16:00:47,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 16:00:47,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 16:00:47,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 16:00:47,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 16:00:47,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 16:00:47,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 16:00:47,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 16:00:47,201 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 16:00:47,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 16:00:47,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 16:00:47,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 16:00:47,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 16:00:47,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 16:00:47,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 16:00:47,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 16:00:47,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 16:00:47,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 16:00:47,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 16:00:47,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 16:00:47,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 16:00:47,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 16:00:47,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 16:00:47,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 16:00:47,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 16:00:47,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 16:00:47,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 16:00:47,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 16:00:47,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 16:00:47,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 16:00:47,219 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 16:00:47,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 16:00:47,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 16:00:47,243 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 16:00:47,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 16:00:47,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 16:00:47,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 16:00:47,244 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 16:00:47,245 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 16:00:47,245 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 16:00:47,245 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 16:00:47,246 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 16:00:47,246 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 16:00:47,246 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 16:00:47,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 16:00:47,246 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 16:00:47,246 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 16:00:47,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 16:00:47,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 16:00:47,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 16:00:47,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 16:00:47,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 16:00:47,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 16:00:47,248 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 16:00:47,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 16:00:47,249 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 16:00:47,249 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 16:00:47,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 16:00:47,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 16:00:47,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 16:00:47,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 16:00:47,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 16:00:47,251 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 16:00:47,251 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 -> 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e [2022-07-23 16:00:47,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 16:00:47,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 16:00:47,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 16:00:47,468 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 16:00:47,471 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 16:00:47,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2022-07-23 16:00:47,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2a70ee7/1e21a4bfabbc483dad6593778788de68/FLAG767dabfe1 [2022-07-23 16:00:47,958 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 16:00:47,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2022-07-23 16:00:47,970 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2a70ee7/1e21a4bfabbc483dad6593778788de68/FLAG767dabfe1 [2022-07-23 16:00:47,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2a70ee7/1e21a4bfabbc483dad6593778788de68 [2022-07-23 16:00:47,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 16:00:47,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 16:00:47,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 16:00:47,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 16:00:47,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 16:00:47,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:00:47" (1/1) ... [2022-07-23 16:00:47,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@611799e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:47, skipping insertion in model container [2022-07-23 16:00:47,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:00:47" (1/1) ... [2022-07-23 16:00:47,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 16:00:48,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 16:00:48,297 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_stateful-1.i[23400,23413] [2022-07-23 16:00:48,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:00:48,415 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 16:00:48,450 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_stateful-1.i[23400,23413] [2022-07-23 16:00:48,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:00:48,534 INFO L208 MainTranslator]: Completed translation [2022-07-23 16:00:48,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48 WrapperNode [2022-07-23 16:00:48,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 16:00:48,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 16:00:48,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 16:00:48,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 16:00:48,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48" (1/1) ... [2022-07-23 16:00:48,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48" (1/1) ... [2022-07-23 16:00:48,623 INFO L137 Inliner]: procedures = 144, calls = 231, calls flagged for inlining = 51, calls inlined = 141, statements flattened = 2621 [2022-07-23 16:00:48,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 16:00:48,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 16:00:48,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 16:00:48,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 16:00:48,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48" (1/1) ... [2022-07-23 16:00:48,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48" (1/1) ... [2022-07-23 16:00:48,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48" (1/1) ... [2022-07-23 16:00:48,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48" (1/1) ... [2022-07-23 16:00:48,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48" (1/1) ... [2022-07-23 16:00:48,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48" (1/1) ... [2022-07-23 16:00:48,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48" (1/1) ... [2022-07-23 16:00:48,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 16:00:48,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 16:00:48,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 16:00:48,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 16:00:48,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48" (1/1) ... [2022-07-23 16:00:48,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:00:48,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:00:48,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:00:48,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 16:00:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 16:00:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 16:00:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 16:00:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 16:00:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 16:00:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 16:00:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 16:00:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 16:00:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 16:00:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 16:00:48,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 16:00:49,094 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 16:00:49,095 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 16:00:49,126 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 16:00:49,127 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 16:00:49,173 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 16:00:49,174 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 16:00:49,198 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 16:00:49,198 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 16:01:02,681 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##706: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##707: 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; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##713: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##714: 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; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-10: assume { :end_inline___CS_cs } true; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume { :end_inline___CS_cs } true; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume { :end_inline___CS_cs } true; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-38: assume { :end_inline___CS_cs } true; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-39: assume { :end_inline___CS_cs } true; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-40: assume { :end_inline___CS_cs } true; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-66: assume { :end_inline___CS_cs } true; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-67: assume { :end_inline___CS_cs } true; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-68: assume { :end_inline___CS_cs } true; [2022-07-23 16:01:02,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-07-23 16:01:02,683 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2); [2022-07-23 16:01:02,683 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-32: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2022-07-23 16:01:02,683 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-30: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2022-07-23 16:01:02,683 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-30: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2022-07-23 16:01:02,683 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-32: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-07-23 16:01:02,683 INFO L764 $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; [2022-07-23 16:01:02,683 INFO L764 $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; [2022-07-23 16:01:02,683 INFO L764 $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; [2022-07-23 16:01:02,684 INFO L764 $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; [2022-07-23 16:01:02,684 INFO L764 $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; [2022-07-23 16:01:02,684 INFO L764 $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; [2022-07-23 16:01:02,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-07-23 16:01:02,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2); [2022-07-23 16:01:02,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-110: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2022-07-23 16:01:02,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##419: 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; [2022-07-23 16:01:02,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##418: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-07-23 16:01:02,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: 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; [2022-07-23 16:01:02,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##425: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-07-23 16:01:02,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-114: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2022-07-23 16:01:02,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-114: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2022-07-23 16:01:02,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-116: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-07-23 16:01:02,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-117: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-117: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-119: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-120: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-120: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-122: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2); [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-188: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-198: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-198: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-200: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-201: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-201: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2022-07-23 16:01:02,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-203: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-204: assume 0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite5#1 := ~__CS_ret_PREEMPTED~0 % 256; [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-204: assume !(0 != __CS_cs_#t~nondet4#1 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite5#1 := ~__CS_ret~0 % 256; [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-206: ~__CS_ret~0 := __CS_cs_#t~ite5#1;havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume !(0 != ~__CS_ret~0 % 256); [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume !(0 != ~__CS_ret~0 % 256); [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: assume !(0 != ~__CS_ret~0 % 256); [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: 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; [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-23 16:01:02,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-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; [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-4: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-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; [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume !(0 != ~__CS_ret~0 % 256); [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: assume !(0 != ~__CS_ret~0 % 256); [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-4: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-4: assume !(0 != ~__CS_ret~0 % 256); [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: 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; [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0#1 % 256 < 2);assume false; [2022-07-23 16:01:02,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: 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; [2022-07-23 16:01:02,687 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 16:01:02,696 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 16:01:02,697 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-23 16:01:02,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:01:02 BoogieIcfgContainer [2022-07-23 16:01:02,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 16:01:02,700 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 16:01:02,700 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 16:01:02,703 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 16:01:02,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:01:02,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 04:00:47" (1/3) ... [2022-07-23 16:01:02,704 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60296447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:01:02, skipping insertion in model container [2022-07-23 16:01:02,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:01:02,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:00:48" (2/3) ... [2022-07-23 16:01:02,705 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60296447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:01:02, skipping insertion in model container [2022-07-23 16:01:02,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:01:02,705 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:01:02" (3/3) ... [2022-07-23 16:01:02,706 INFO L354 chiAutomizerObserver]: Analyzing ICFG cs_stateful-1.i [2022-07-23 16:01:02,751 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 16:01:02,752 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 16:01:02,752 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 16:01:02,752 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 16:01:02,752 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 16:01:02,752 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 16:01:02,752 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 16:01:02,753 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 16:01:02,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 646 states, 645 states have (on average 1.4930232558139536) internal successors, (963), 645 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:01:02,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 16:01:02,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:01:02,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:01:02,804 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:01:02,804 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 16:01:02,805 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 16:01:02,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 646 states, 645 states have (on average 1.4930232558139536) internal successors, (963), 645 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:01:02,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 16:01:02,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:01:02,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:01:02,816 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:01:02,816 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 16:01:02,820 INFO L752 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#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(16, 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(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 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);~__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_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 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);~__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(24, 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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; 544#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, 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, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#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_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 231#L758-3true [2022-07-23 16:01:02,820 INFO L754 eck$LassoCheckResult]: Loop: 231#L758-3true assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 223#L759-3true assume !(main_~j~2#1 < 3); 457#L759-4true call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; 9#L758-2true main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; 231#L758-3true [2022-07-23 16:01:02,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:01:02,825 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 16:01:02,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:01:02,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670339158] [2022-07-23 16:01:02,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:01:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:01:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:01:03,004 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:01:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:01:03,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:01:03,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:01:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1237577, now seen corresponding path program 1 times [2022-07-23 16:01:03,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:01:03,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448274206] [2022-07-23 16:01:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:01:03,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:01:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:01:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:01:03,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:01:03,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448274206] [2022-07-23 16:01:03,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448274206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:01:03,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:01:03,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 16:01:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819991463] [2022-07-23 16:01:03,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:01:03,130 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 16:01:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:01:03,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 16:01:03,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 16:01:03,154 INFO L87 Difference]: Start difference. First operand has 646 states, 645 states have (on average 1.4930232558139536) internal successors, (963), 645 states have internal predecessors, (963), 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) [2022-07-23 16:01:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:01:03,195 INFO L93 Difference]: Finished difference Result 648 states and 871 transitions. [2022-07-23 16:01:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 16:01:03,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 648 states and 871 transitions. [2022-07-23 16:01:03,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-23 16:01:03,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 648 states to 9 states and 10 transitions. [2022-07-23 16:01:03,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-23 16:01:03,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-23 16:01:03,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-07-23 16:01:03,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:01:03,210 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-23 16:01:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-07-23 16:01:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-07-23 16:01:03,228 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) [2022-07-23 16:01:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-07-23 16:01:03,229 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-23 16:01:03,229 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-23 16:01:03,229 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 16:01:03,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-07-23 16:01:03,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-23 16:01:03,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:01:03,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:01:03,230 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:01:03,230 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 16:01:03,230 INFO L752 eck$LassoCheckResult]: Stem: 1306#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#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(16, 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(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 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);~__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_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 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);~__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(24, 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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; 1307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, 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, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#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_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 1309#L758-3 [2022-07-23 16:01:03,230 INFO L754 eck$LassoCheckResult]: Loop: 1309#L758-3 assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 1303#L759-3 assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; 1304#L759-2 main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; 1305#L759-3 assume !(main_~j~2#1 < 3); 1310#L759-4 call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; 1308#L758-2 main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; 1309#L758-3 [2022-07-23 16:01:03,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:01:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-23 16:01:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:01:03,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084763790] [2022-07-23 16:01:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:01:03,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:01:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:01:03,255 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:01:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:01:03,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:01:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:01:03,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1191030535, now seen corresponding path program 1 times [2022-07-23 16:01:03,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:01:03,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840444121] [2022-07-23 16:01:03,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:01:03,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:01:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:01:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:01:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:01:03,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840444121] [2022-07-23 16:01:03,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840444121] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:01:03,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884697203] [2022-07-23 16:01:03,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:01:03,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:01:03,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:01:03,316 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) [2022-07-23 16:01:03,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 16:01:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:01:03,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 16:01:03,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:01:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:01:03,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:01:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:01:03,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884697203] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:01:03,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:01:03,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-07-23 16:01:03,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855887485] [2022-07-23 16:01:03,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:01:03,486 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 16:01:03,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:01:03,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 16:01:03,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-23 16:01:03,487 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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) [2022-07-23 16:01:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:01:03,516 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-07-23 16:01:03,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 16:01:03,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2022-07-23 16:01:03,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-07-23 16:01:03,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2022-07-23 16:01:03,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-07-23 16:01:03,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-23 16:01:03,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2022-07-23 16:01:03,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:01:03,518 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-23 16:01:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2022-07-23 16:01:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-23 16:01:03,519 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) [2022-07-23 16:01:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-07-23 16:01:03,519 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-23 16:01:03,519 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-23 16:01:03,520 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 16:01:03,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2022-07-23 16:01:03,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-07-23 16:01:03,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:01:03,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:01:03,520 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:01:03,520 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 1, 1, 1, 1] [2022-07-23 16:01:03,521 INFO L752 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#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(16, 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(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 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);~__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_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 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);~__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(24, 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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; 1364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, 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, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#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_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 1367#L758-3 [2022-07-23 16:01:03,521 INFO L754 eck$LassoCheckResult]: Loop: 1367#L758-3 assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 1361#L759-3 assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; 1362#L759-2 main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; 1365#L759-3 assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; 1372#L759-2 main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; 1371#L759-3 assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; 1370#L759-2 main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; 1369#L759-3 assume !(main_~j~2#1 < 3); 1368#L759-4 call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; 1366#L758-2 main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; 1367#L758-3 [2022-07-23 16:01:03,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:01:03,521 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-23 16:01:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:01:03,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832880504] [2022-07-23 16:01:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:01:03,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:01:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:01:03,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:01:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:01:03,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:01:03,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:01:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2055044605, now seen corresponding path program 2 times [2022-07-23 16:01:03,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:01:03,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616307616] [2022-07-23 16:01:03,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:01:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:01:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:01:03,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:01:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:01:03,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:01:03,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:01:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash 149568325, now seen corresponding path program 1 times [2022-07-23 16:01:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:01:03,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837724850] [2022-07-23 16:01:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:01:03,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:01:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:01:03,798 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:01:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:01:03,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:12,115 WARN L233 SmtUtils]: Spent 1.14m on a formula simplification. DAG size of input: 306 DAG size of output: 290 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)